#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, -1, 1};
int dy[] = {1, 1, 0, 0};
vector<pair<int, int> > w;
vector<pair<int, int> > q;
int main() {
  int n, m, k, t, a, b;
  cin >> n >> m >> k >> t;
  for (int i = 0; i < k; i++) {
    cin >> a >> b;
    w.push_back({a, b});
  }
  for (int i = 0; i < t; i++) {
    cin >> a >> b;
    q.push_back({a, b});
  }
  for (int i = 0; i < t; i++) {
    if (find(w.begin(), w.end(), q[i]) != w.end()) {
      cout << "Waste\n";
    } else {
      int b = 0, a = m * (q[i].first - 1) + q[i].second;
      for (int j = 0; j < w.size(); j++) {
        if (w[j].first < q[i].first ||
            w[j].first == q[i].first && w[j].second < q[i].second)
          b++;
      }
      if ((a - b) % 3 == 1)
        cout << "Carrots\n";
      else if ((a - b) % 3 == 0)
        cout << "Grapes\n";
      else if ((a - b) % 3 == 2)
        cout << "Kiwis\n";
    }
  }
  return 0;
}
