#include <bits/stdc++.h>
using namespace std;
string ss[] = {"Grapes", "Carrots", "Kiwis"};
int main() {
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  vector<pair<int, int> > waste(k);
  for (int i = 0; i < k; i++) cin >> waste[i].first >> waste[i].second;
  for (int i = 0; i < t; i++) {
    int x, y;
    bool ok = 0;
    cin >> x >> y;
    int tot = (x - 1) * m + y;
    for (int j = 0; j < k; j++) {
      if (waste[j].first == x && waste[j].second == y) ok = 1;
      if (waste[j].first < x || (waste[j].first == x && waste[j].second <= y))
        tot--;
    }
    if (!ok)
      cout << ss[tot % 3] << endl;
    else
      cout << "Waste" << endl;
  }
}
