#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int MAX = 1e4 + 5;
int n, m, k, t;
vector<pair<int, int> > wastes;
bool iswaste(int x, int y) {
  for (auto &p : wastes) {
    if (x == p.first and y == p.second) {
      return true;
    }
  }
  return false;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k >> t;
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    wastes.push_back({x, y});
  }
  for (int i = 0; i < t; i++) {
    int x, y;
    cin >> x >> y;
    if (iswaste(x, y)) {
      cout << "Waste"
           << "\n";
    } else {
      int pos = (x - 1) * m + (y - 1);
      for (int j = 0; j < k; j++) {
        if (wastes[j].first < x or
            (wastes[j].first == x and wastes[j].second < y)) {
          pos--;
        }
      }
      switch (pos % 3) {
        case 0:
          cout << "Carrots"
               << "\n";
          break;
        case 1:
          cout << "Kiwis"
               << "\n";
          break;
        case 2:
          cout << "Grapes"
               << "\n";
          break;
      }
    }
  }
  return 0;
}
