#include <bits/stdc++.h>
using namespace std;
int a[1005];
int main() {
  int n, m, K, T;
  scanf("%d%d%d%d", &n, &m, &K, &T);
  for (int i = 0; i < K; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--;
    y--;
    a[i] = x * m + y;
  }
  sort(a, a + K);
  for (int i = 0; i < T; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--;
    y--;
    int lo = -1, hi = K;
    while (lo + 1 < hi) {
      int mid = (lo + hi) / 2;
      if (a[mid] <= x * m + y)
        lo = mid;
      else
        hi = mid;
    }
    if (lo >= 0 && a[lo] == x * m + y)
      puts("Waste");
    else {
      int Cnt = x * m + y + 1 - (lo + 1);
      if (Cnt % 3 == 0)
        puts("Grapes");
      else if (Cnt % 3 == 1)
        puts("Carrots");
      else
        puts("Kiwis");
    }
  }
  return 0;
}
