#include <bits/stdc++.h>
using namespace std;
string arr[3] = {"Carrots", "Kiwis", "Grapes"};
void solve() {
  int n, m, k, t;
  int a, b;
  int cnt = 0;
  cin >> n >> m >> k >> t;
  vector<pair<int, int>> waste;
  for (int i = 0; i < k; i++) {
    cin >> a >> b;
    waste.emplace_back(a, b);
  }
  sort(waste.begin(), waste.end());
  for (int j = 0; j < t; j++) {
    cin >> a >> b;
    int wst = 0;
    auto it = lower_bound(waste.begin(), waste.end(), make_pair(a, b));
    if (it != waste.end() && (*it).first == a && (*it).second == b) {
      cout << "Waste";
    } else {
      if (it != waste.end())
        wst = it - waste.begin();
      else
        wst = waste.size();
      cout << arr[((a - 1) * m + (b - 1) - wst) % 3];
    }
    if (j < t - 1) cout << endl;
  }
}
int main() {
  solve();
  return 0;
}
