#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > rows;
char str[3][100] = {"Carrots", "Kiwis", "Grapes"};
int main() {
  int n, m, k, t;
  scanf("%d%d%d%d", &n, &m, &k, &t);
  for (int i = 0; i < k; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--, b--;
    rows.push_back(make_pair(a, b));
  }
  sort(rows.begin(), rows.end());
  for (int i = 0; i < t; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--, b--;
    pair<int, int> t = make_pair(a, b);
    int y = lower_bound(rows.begin(), rows.end(), t) - rows.begin();
    if (y == rows.size() || rows[y] != t)
      printf("%s\n", str[(a * m + b - y) % 3]);
    else
      printf("Waste\n");
  }
}
