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();
            int first = in.nextInt();
            int second = in.nextInt();
            
            if(queryType==1)
                c[first] = second;
            else
            {
                boolean flag = true;
                
                //for(int i=0; i<n; i++)
                    //System.out.print(c[i]+ " ");
                for(int i=0; i<n-2; i++)
                {
                    int qa = a;
                    int qb = b;
                    //System.out.println(c[i] + " " + c[i+1] + " " + b + " " + a);
                    /*if(!(c[i]%qb==0 && c[i+1]%qa==0))
                    {
                        flag = false;
                        //System.out.println("jdfks");
                        break;
                    }*/
                    
                    int num = qb/c[i];
                    
                    c[i] -= num*qb;
                    c[i+1] -= num*qa;
                }
                
                if(c[n-1]!=0)
                    flag = false;
                
                if(flag==true)
                    System.out.println("Yes");
                else
                    System.out.println("No");
            }
        }
    }
}