#include <bits/stdc++.h>
using namespace std;
vector<int> a;
int bs(int b, int e, int t) {
  int m;
  while (1) {
    m = (b + e) / 2;
    if (t == a[m]) {
      return m;
    } else if (b == m) {
      if (t < a[b]) {
        return b;
      } else {
        return e;
      }
    } else {
      if (t > a[m]) {
        b = m;
      } else {
        e = m;
      }
    }
  }
}
void setup();
int main() {
  setup();
  int n, m, k, t, r, c, e;
  string s[4] = {"Grapes", "Carrots", "Kiwis", "Waste"};
  cin >> n >> m >> k >> t;
  for (int x = 0; x < k; x++) {
    cin >> r >> c;
    a.push_back((r - 1) * m + c);
  }
  sort(a.begin(), a.end());
  for (int x = 0; x < t; x++) {
    cin >> r >> c;
    e = (r - 1) * m + c;
    if (!a.size()) {
      cout << s[e % 3] << endl;
    } else {
      if (e < a[0]) {
        cout << s[e % 3] << endl;
      } else if (e > a[a.size() - 1]) {
        cout << s[(e - a.size()) % 3] << endl;
      } else {
        int p = bs(0, a.size() - 1, e);
        if (a[p] == e) {
          cout << s[3] << endl;
        } else {
          cout << s[(e - p) % 3] << endl;
        }
      }
    }
  }
  return 0;
}
void setup() { ios_base::sync_with_stdio(false); }
