#include <bits/stdc++.h>
using namespace std;
int main() {
  string v[] = {"Carrots", "Kiwis", "Grapes"};
  int r, c, t, k, a, b;
  cin >> r >> c >> k >> t;
  vector<int> waste;
  for (int i = 0; i < k; i++) {
    cin >> a >> b;
    int ind = ((a - 1) * c) + (b - 1);
    waste.push_back(ind);
  }
  sort(waste.begin(), waste.end());
  for (int i = 0; i < t; i++) {
    cin >> a >> b;
    int ind = ((a - 1) * c) + (b - 1);
    if (find(waste.begin(), waste.end(), ind) != waste.end())
      cout << "Waste\n";
    else {
      int cont = 0;
      for (int u = 0; u < waste.size(); u++) {
        if (waste[u] < ind) {
          cont++;
        } else
          break;
      }
      cout << v[abs(ind - cont) % 3] << endl;
    }
  }
  return 0;
}
