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();
        double factor=(-b)/(float)a,sum=0;
        int q = in.nextInt();
        int[] c = new int[n];
        int q_type,c_index,x,l,r;
        for(int c_i=0; c_i < n; c_i++){
            c[c_i] = in.nextInt();
        }
        
        for(int i=0;i<q;i++)
        {
           q_type=in.nextInt();
            if(q_type==1)
            {
               c_index=in.nextInt();
                x=in.nextInt();
                c[c_index]=x;
            }
            else
             {
                l=in.nextInt();
                r=in.nextInt();
                int k=0;
                sum=0;
                for(int j=l;j<=r;j++)
                {
                    sum=sum+(c[j]*Math.pow(factor,k));
                    k++;
                }
                if(sum==0)
                    System.out.println("Yes");
                else
                    System.out.println("No");
                
            }
        }
        
    }
}