#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;

int main(void) {

    long long int n, a, b, q;
    cin >> n >> a >> b >> q;
    vector<long long int> c(n);
    for(int i=0; i<n; i++) cin >> c[i];

    vector<long long int> type(q);
    vector<long long int> l(q);
    vector<long long int> r(q);
    for(int i=0; i<q; i++){
      cin >> type[i] >> l[i] >> r[i];
    }

    for(int i=0; i<q; i++){
      if( type[i] == 1 ){
        c[ l[i]-1 ] = r[i];
      }else if( type[i] == 2 ){
        if( r[i] == l[i] ) cout << "No" << endl;
        else{
          cout << "Yes" << endl;
        }
      }
    }



    return 0;
}