#include <bits/stdc++.h>
using namespace std;
vector<int> d[40005];
int s[40005];
int main() {
  int n, m, k, l, i, j, t, x, y, num, sum, re;
  while (scanf("%d%d%d%d", &n, &m, &k, &t) == 4) {
    memset(s, 0, sizeof(s));
    for (i = 1; i <= n; i++) d[i].clear();
    for (i = 0; i < k; i++) {
      scanf("%d%d", &x, &y);
      s[x]++;
      d[x].push_back(y);
    }
    for (i = 1; i <= n; i++) {
      s[i] += s[i - 1];
    }
    for (i = 0; i < t; i++) {
      num = 0;
      re = 0;
      scanf("%d%d", &x, &y);
      for (j = 0; j < d[x].size(); j++) {
        if (d[x][j] == y) {
          re = 1;
          printf("Waste\n");
          break;
        }
        if (d[x][j] < y) num++;
      }
      if (!re) {
        num += s[x - 1];
        sum = m * (x - 1) + y;
        sum -= num;
        if (sum % 3 == 1)
          printf("Carrots\n");
        else if (sum % 3 == 2)
          printf("Kiwis\n");
        else
          printf("Grapes\n");
      }
    }
  }
  return 0;
}
