#include <bits/stdc++.h>
using namespace std;
void solve() {
  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;
  sort(waste.begin(), waste.end());
  while (t--) {
    int a, b, cnt = 0;
    cin >> a >> b;
    bool flag = false;
    for (int i = 0; i < k; i++) {
      if (waste[i].first == a && waste[i].second == b) {
        flag = true;
        break;
      }
      if (waste[i].first == a && waste[i].second > b) break;
      if (waste[i].first > a) break;
      cnt += 1;
    }
    if (flag) {
      cout << "Waste" << '\n';
      continue;
    } else {
      int tot_cell = (a - 1) * m + b;
      int req_cell = (tot_cell - cnt) % 3;
      if (req_cell == 1)
        cout << "Carrots" << '\n';
      else if (req_cell == 2)
        cout << "Kiwis" << '\n';
      else
        cout << "Grapes" << '\n';
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int tt = 1, no = 0;
  while (tt--) {
    solve();
  }
  return 0;
}
