#include <bits/stdc++.h>
using namespace std;
map<int, int> w;
map<int, int>::iterator it;
int n, m, k, t;
int main() {
  int x, y, i;
  scanf("%d%d%d%d", &n, &m, &k, &t);
  w.clear();
  while (k--) {
    scanf("%d%d", &x, &y);
    w[x * m + y - 1] = 1;
  }
  k = 0;
  for (it = w.begin(); it != w.end(); it++) it->second = ++k;
  w[0] = 0;
  while (t--) {
    scanf("%d%d", &x, &y);
    if (w.find(x * m + y - 1) != w.end())
      printf("Waste\n");
    else {
      it = w.upper_bound(x * m + y - 1);
      it--;
      int crop = ((x - 1) * m + y - it->second) % 3;
      if (crop == 1)
        printf("Carrots\n");
      else if (crop == 2)
        printf("Kiwis\n");
      else
        printf("Grapes\n");
    }
  }
  return 0;
}
