#include <bits/stdc++.h>
using namespace std;
long pos(vector<long> w, long n) {
  int count = 0;
  for (int i = 0; i < (int)w.size(); i++) {
    if (w[i] < n) {
      count++;
    }
  }
  return count;
}
bool binarySearch(vector<long> w, long n) {
  int s = 0, e = w.size() - 1;
  while (s <= e) {
    int mid = (s + e) / 2;
    if (w[mid] == n)
      return true;
    else if (w[mid] > n)
      e = mid - 1;
    else
      s = mid + 1;
  }
  return false;
}
int main() {
  int n, m, k, t;
  scanf("%d %d %d %d", &n, &m, &k, &t);
  vector<long> w;
  while (k--) {
    int i, j;
    scanf("%d %d", &i, &j);
    w.push_back((i - 1) * m + j);
  }
  sort(w.begin(), w.end());
  while (t--) {
    int i, j;
    scanf("%d %d", &i, &j);
    long n = (i - 1) * m + j;
    if (binarySearch(w, n)) {
      cout << "Waste"
           << "\n";
    } else {
      n -= pos(w, n);
      n = n % 3;
      if (n == 1)
        cout << "Carrots"
             << "\n";
      else if (n == 2)
        cout << "Kiwis"
             << "\n";
      else
        cout << "Grapes"
             << "\n";
    }
  }
}
