#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, k, q, u, v, x;
  set<long long> s;
  deque<long long> d;
  map<long long, string> maps;
  maps[1] = "Carrots";
  maps[2] = "Kiwis";
  maps[0] = "Grapes";
  cin >> n >> m >> k >> q;
  for (int i = 0; i < k; i++) {
    cin >> u >> v;
    s.insert(((u - 1) * m) + v);
  }
  for (auto p : s) d.push_back(p);
  while (q--) {
    cin >> u >> v;
    x = (((u - 1) * m) + v);
    u = *lower_bound(d.begin(), d.end(), x);
    if (u == x)
      cout << "Waste" << endl;
    else {
      u = lower_bound(d.begin(), d.end(), x) - d.begin();
      x -= u;
      x %= 3;
      cout << maps[x] << endl;
    }
  }
  return 0;
}
