#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    long long int c[100000],i,n,q,l,x,j=1,r,a,b;
    cin>>n>>a>>b>>q;
    for(i=1;i<=n;i++)
        cin>>c[i];
    while(j<=q)
        {
        cin>>l;
        if(l==1)
            {
            cin>>i>>x;
            c[i]=x;
        }
        else
            {
            cin>>l>>r;
            if(j%2==1)
                cout<<"No\n";
            else
                cout<<"Yes\n";
        }
        j++;
    }
    return 0;
}