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 i = 0; i < q; i++){
            int queryType = in.nextInt();
            int first = in.nextInt();
            int second = in.nextInt();
            if(queryType==1)
                c[first]=second;
            else
                {
                int p=0;
                for(int t=0;t<=second-first;t++)
                    {
                    p+=c[first+t]*Math.pow(-(b/a),t);
                }
                if(p==0)
                    System.out.println("Yes");
                    else
                    System.out.println("No");
            }
            
    }
}
}