#include <bits/stdc++.h>
using namespace std;
int right_bin_search(int value, int *a, int n) {
  int L = 0, R = n - 1, M;
  while (R - L > 1) {
    M = (L + R) / 2;
    if (a[M] <= value)
      L = M;
    else
      R = M;
  }
  if (a[R] <= value)
    return R;
  else if (a[L] <= value)
    return L;
  else
    return -1;
}
int main() {
  string names[3] = {"Carrots", "Kiwis", "Grapes"};
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  int *bad = new int[k];
  int a, b;
  for (int i = 0; i < k; i++) {
    cin >> a >> b;
    bad[i] = (a - 1) * m + b - 1;
  }
  sort(bad, bad + k);
  for (int q = 0; q < t; q++) {
    cin >> a >> b;
    int val = (a - 1) * m + b - 1;
    int temp = right_bin_search(val, bad, k);
    if (temp != -1 && bad[temp] == val)
      cout << "Waste\n";
    else {
      int pos = (val + 1) - (temp + 1);
      cout << names[(pos - 1) % 3] << '\n';
    }
  }
  delete[] bad;
  return 0;
}
