#include <bits/stdc++.h>
using namespace std;
bool mycom(pair<long long, long long> &a, pair<long long, long long> &b) {
  if (a.first != b.first)
    return a.first < b.first;
  else {
    return a.second < b.second;
  }
}
vector<pair<long long, long long> > v;
long long n, m, k, t, a, b;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k >> t;
  for (int i = 0; i < k; i++) {
    cin >> a >> b;
    v.push_back({a, b});
  }
  sort(((v).begin()), ((v).end()), mycom);
  for (int i = 0; i < t; i++) {
    cin >> a >> b;
    pair<long long, long long> p = {a, b};
    bool ex = binary_search(((v).begin()), ((v).end()), p);
    if (ex)
      cout << "Waste" << endl;
    else {
      n = (a - 1) * m + b;
      auto it = lower_bound(((v).begin()), ((v).end()), p);
      long long type = n - (it - ((v).begin()));
      if (type % 3 == 1)
        cout << "Carrots" << endl;
      else if (type % 3 == 2)
        cout << "Kiwis" << endl;
      else
        cout << "Grapes" << endl;
    }
  }
  return 0;
}
