import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a = in.nextInt();
        int b = in.nextInt();
        int q = in.nextInt();
        int[] c = new int[n];
        for(int c_i=0; c_i < n; c_i++){
            c[c_i] = in.nextInt();
        }
        for(int a0 = 0; a0 < q; a0++){
            int queryType = in.nextInt();
            
            if(queryType==1)
                {
                int i = in.nextInt();
                int x = in.nextInt();
                c[i]=x;
            }
            else
                {
                int l = in.nextInt();
                int r = in.nextInt();
                long sum = 0;
                int counter = l;
                for(int i = 0 ;i<=r-l;i++)
                    {
                    if((b>0&&a<0)||(b<0&&a>0)||i%2==0)
                    sum+=c[counter++]*(long)Math.pow((b*1.0/a),i);
                    else
                        sum-=c[counter++]*(long)Math.pow(Math.abs(b*1.0/a),i);
                }
                
                if(sum==0)
                    System.out.println("Yes");
                else
                    System.out.println("No");
            }
        }
    }
}