import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Main
{
    static BufferedReader reader;
    static StringTokenizer tokenizer;
    static void init(InputStream input)
    {
        reader = new BufferedReader( new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }
    static String next() throws IOException
    {
        while ( ! tokenizer.hasMoreTokens() )
        {
            tokenizer = new StringTokenizer(reader.readLine() );
        }
        return tokenizer.nextToken();
    }
 
    static long nextInt() throws IOException
    {
        return Long.parseLong( next() );
    }
    static PrintWriter writer;
    static void outit(OutputStream outputStream)
    {
        writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    }
    static void print(Object...objects) {
        for (int i = 0; i < objects.length; i++) {
            if (i != 0)
                writer.print(' ');
            writer.print(objects[i]);
        }
    }
 
    static void println(Object...objects) {
        print(objects);
        writer.println();
    }
 
    static void close() {
        writer.close();
    }
 
    static void flush() {
        writer.flush();
    }
    static ArrayList<ArrayList<Integer>> sieve ;
    static long [] mob ;
    public static void main(String [] args) throws IOException
    {
        init(System.in) ;
        outit(System.out) ;
//    	int t = (int)nextInt() ;
//    	for(int i =0 ; i<t ; i++)
        output() ;
        flush();
        close();
    }
    public static int p(int i)
    {
    	return (int)Math.pow(2,i) ;
    }
    static long mod = 1000000007 ;
    static long [][][] cache ;
    public static void output() throws IOException
    {
    	int n = (int)nextInt() ;
    	long a = nextInt() ;
    	long b = nextInt() ;
    	long inv_a = InverseEuler(a,mod) ;
    	long inp = (-(b*inv_a)%mod+mod)%mod ;
//    	println(inp);
    	int q = (int)nextInt() ;
    	long [] BIT = new long[n] ;
    	for(int i =0  ;i<n ; i++)
    	{
    		long c =  nextInt() ;
    		long val = (c*pow(inp,i,mod))%mod ;
//    		println("*"+val) ;
    		updateBIT(BIT,i,val) ;
    	}
    	for(int i = 0 ;i<q ; i++)
    	{
    		int t = (int)nextInt() ;
    		if(t==1)
    		{
    			int ind = (int)nextInt() ;
    			long c = nextInt() ;
    			long val = (c*pow(inp,ind,mod))%mod ;
    			long ex = query_range(BIT,ind,ind) ;
//    			println("*"+ex+" "+val) ;
    			updateBIT(BIT,ind,(val-ex+mod)%mod) ;
    		}
    		else
    		{
    			int l = (int)nextInt() ;
    			int r = (int)nextInt() ;
    			long ans = query_range(BIT,l,r) ;
//    			println(ans) ;
    			if(ans==0)
    			{
    				println("Yes") ;
    			}
    			else
    			{
    				println("No") ;
    			}
    		}
    	}
    }
    public static long pow(long a, long b, long MOD)
    {
        long x=1,y=a; 
        while(b > 0)
        {
            if(b%2 == 1)
            {
                x=(x*y);
                if(x>MOD) x%=MOD;
            }
            y = (y*y);
            if(y>MOD) y%=MOD; 
            b /= 2;
        }
        return x;
    }
    public static long InverseEuler(long n, long MOD)
    {
        return pow(n,MOD-2,MOD);
    }
    static void updateBIT(long[] arr, int pos, long val) 
    {
        int len = arr.length;
        for (; pos < len; pos |= (pos + 1)) 
            arr[pos] =(arr[pos]+ val)%mod;
    }
    static long query(long[] arr, int pos) 
    {
        long sum = 0;
        for (; pos >= 0; pos = (pos & (pos + 1)) - 1) 
            sum = (sum+ arr[pos])%mod;
        return sum;
    }
    static void print_BIT(long []BIT,int n)
    {
    	for(int i = 0 ; i<n ; i++)
    	{
    		
    	}
    }
    static long query_range(long [] BIT,int l,int r)
    {
    	if(l==0)
    	{
    		return query(BIT,r) ;
    	}
    	else
    	{
    		return (query(BIT,r)-query(BIT,l-1)+mod)%mod ;
    	}
    }
}