#include <bits/stdc++.h>
using namespace std;
long long waste[1005], k, t, cnt;
long long getWasteCnt(long long pos, bool *isWaste) {
  bool end = false;
  for (long long i = 1; i <= k; i++) {
    (pos >= waste[i]) ? cnt++ : end = true;
    if (pos == waste[i]) *isWaste = true;
    if (end) break;
  }
  return (cnt % 3);
}
int main() {
  long long i, n, m, r, c, wcnt, pos;
  cin >> n >> m >> k >> t;
  for (i = 1; i <= k; i++) {
    cin >> r >> c;
    waste[i] = (m * (r - 1) + c);
  }
  sort(waste + 1, waste + k + 1);
  for (i = 1; i <= t; i++) {
    cin >> r >> c;
    cnt = 0;
    bool isWaste = false;
    pos = (m * (r - 1) + c);
    wcnt = getWasteCnt(pos, &isWaste);
    if (isWaste)
      cout << "Waste\n";
    else
      switch (pos % 3) {
        case 0:
          (wcnt == 0) ? cout << "Grapes\n"
                      : ((wcnt == 1) ? cout << "Kiwis\n" : cout << "Carrots\n");
          break;
        case 1:
          (wcnt == 0) ? cout << "Carrots\n"
                      : ((wcnt == 1) ? cout << "Grapes\n" : cout << "Kiwis\n");
          break;
        case 2:
          (wcnt == 0)
              ? cout << "Kiwis\n"
              : ((wcnt == 1) ? cout << "Carrots\n" : cout << "Grapes\n");
          break;
      }
  }
}
