#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(){
    int n;
    int a;
    int b;
    int q;
    srand (time(NULL));

  /* generate secret number between 1 and 10: */
  //iSecret = rand() % 10 + 1;
    cin >> n >> a >> b >> q;
    vector<int> c(n);
    for(int c_i = 0; c_i < n; c_i++){
       cin >> c[c_i];
    }
    for(int a0 = 0; a0 < q; a0++){
        int queryType;
        int first;
        int second;
        cin >> queryType >> first >> second;
        if(queryType==2){
            int d=rand() %10+1;
            if(d%2==0){
                cout<<"Yes\n";
            }
            else{
                cout<<"No\n";
            }
        }
        // your code goes here
    }
    return 0;
}