#include <bits/stdc++.h>
using namespace std;
const int SIZE = 100000;
int A[SIZE];
int vs(const void *a, const void *b) {
  if (*(int *)a > *(int *)b)
    return 1;
  else
    return -1;
}
int main() {
  int N, M, k, t, a, b, c;
  cin >> N >> M >> k >> t;
  for (int i = 0; i != k; i++) {
    cin >> a >> b;
    A[i] = (a - 1) * M + b - 1;
  }
  qsort(A, k, sizeof(int), vs);
  for (int i = 0; i != t; i++) {
    cin >> a >> b;
    c = (a - 1) * M + b - 1;
    int j = 0;
    while (A[j] < c && j != k) j++;
    if (A[j] == c)
      cout << "Waste" << endl;
    else {
      c -= j;
      if (c % 3 == 0)
        cout << "Carrots" << endl;
      else if (c % 3 == 1)
        cout << "Kiwis" << endl;
      else
        cout << "Grapes" << endl;
    }
  }
  return 0;
}
