#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  vector<pii> waste(k);
  for (int i = 0; i < k; ++i) {
    cin >> waste[i].first >> waste[i].second;
    --waste[i].first;
    --waste[i].second;
  }
  sort(begin(waste), end(waste));
  vector<pair<pii, int>> queries(t);
  for (int i = 0; i < t; ++i) {
    cin >> queries[i].first.first >> queries[i].first.second;
    --queries[i].first.first;
    --queries[i].first.second;
    queries[i].second = i;
  }
  sort(begin(queries), end(queries));
  vector<int> ans(t);
  int ptr = 0;
  for (auto& p : queries) {
    pii pos = p.first;
    int idx = p.second;
    while (ptr < k and waste[ptr] < pos) {
      ++ptr;
    }
    if (ptr < k and waste[ptr] == pos) {
      ans[idx] = 3;
    } else {
      int tot = m * pos.first + pos.second;
      tot -= ptr;
      ans[idx] = tot % 3;
    }
  }
  vector<string> res = {"Carrots", "Kiwis", "Grapes", "Waste"};
  for (int x : ans) cout << res[x] << '\n';
  return 0;
}
