import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), a = ni(), b = ni(), Q = ni();
		int[] c = na(n);
		for(int i = 0, j = n-1;i<j;i++,j--){
			int d = c[i]; c[i] = c[j]; c[j] = d;
		}
		int mod = 1000000007;
		
		long K = (mod-b)*invl(a, mod) % mod;
		SegmentTreeRSQHash st = new SegmentTreeRSQHash(c, K, mod);
		for(int z = 0;z < Q;z++){
			int t = ni();
			if(t == 1){
				int pos = ni(), v = ni();
				st.update(n-1-pos, v);
			}else{
				int l = ni(), r = ni();
				if(st.sum(n-1-r, n-1-l+1) == 0L){
					out.println("Yes");
				}else{
					out.println("No");
				}
			}
		}
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}

	
	public static class SegmentTreeRSQHash {
		public int M, H, N;
		public long[] st;
		public long[] cover;
		public long MUL, MOD;
		
		public long[] pows;
		public long[] gas;
		
		private void init()
		{
			pows = new long[H+1];
			pows[0] = 1;
			for(int i = 1;i <= H;i++)pows[i] = pows[i-1] * MUL % MOD;
			gas = new long[H+1];
			gas[0] = 1;
			for(int i = 1;i <= H;i++){
				gas[i] = gas[i-1] + pows[i];
				if(gas[i] >= MOD)gas[i] -= MOD;
			}
		}
		
		public SegmentTreeRSQHash(int n, long MUL, long MOD)
		{
			this.MUL = MUL;
			this.MOD = MOD;
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new long[M];
			init();
		}
		
		public SegmentTreeRSQHash(int[] a, long MUL, long MOD)
		{
			this.MUL = MUL;
			this.MOD = MOD;
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new long[M];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
			}
			cover = new long[H];
			init();
			
			for(int i = (M>>1)-1;i >= 1;i--){
				propagate(i);
			}
		}
		
		private void propagate(int i)
		{
			if(cover[i] == 0){
				st[i] = (st[2*i]*pows[H/Integer.highestOneBit(i)/2]+st[2*i+1])%MOD;
			}else{
				st[i] = cover[i]*gas[H/Integer.highestOneBit(i)-1]%MOD;
			}
		}
		
		public void update(int x, long v)
		{
			st[H+x] = v;
			for(int cur = H+x>>>1;cur >= 1;cur>>>=1)propagate(cur);
		}
		
		public void update(int l, int r, int v) { 
			update(l, r, v, 0, H, 1);
		}
		
		protected void update(int l, int r, int v, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				if(cur >= H){
					st[cur] = v;
				}else{
					cover[cur] = v;
					propagate(cur);
				}
			}else{
				if(cover[cur] != 0){
					if(2*cur < H){
						cover[2*cur] = cover[2*cur+1] = cover[cur];
						cover[cur] = 0;
						propagate(2*cur);
						propagate(2*cur+1);
					}else{
						st[2*cur] = st[2*cur+1] = cover[cur];
						cover[cur] = 0;
					}
				}
				
				int mid = cl+cr>>>1;
				if(cl < r && l < mid){
					update(l, r, v, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					update(l, r, v, mid, cr, 2*cur+1);
				}
				propagate(cur);
			}
		}
		
		public long sum(int l, int r) { 
			return sum(l, r, 0, H, 1);
		}
		
		protected long sum(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return st[cur];
			}else{
				if(cover[cur] != 0){
					int len = Math.min(r, cr) - Math.max(l, cl);
					return gas[len-1] * cover[cur] % MOD;
				}
				
				long L = Long.MIN_VALUE, R = Long.MIN_VALUE;
				int mid = cl+cr>>>1;
				if(cl < r && l < mid){
					L = sum(l, r, cl, mid, 2*cur);
				}
				if(mid < r && l < cr){
					R = sum(l, r, mid, cr, 2*cur+1);
				}
				if(L != Long.MIN_VALUE && R != Long.MIN_VALUE){
					int rlen = Math.min(r, cr) - Math.max(l, mid);
					return (pows[rlen] * L + R) % MOD;
				}else if(L != Long.MIN_VALUE){
					return L;
				}else if(R != Long.MIN_VALUE){
					return R;
				}else{
					throw new RuntimeException();
				}
			}
		}
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}