#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  vector<string> str = {"Carrots", "Kiwis", "Grapes"};
  vector<pair<int, int>> vc;
  for (int i = 0; i < k; i++) {
    int a, b;
    cin >> a >> b;
    vc.push_back({a, b});
  }
  sort(vc.begin(), vc.end());
  for (int i = 0; i < t; i++) {
    int a, b;
    cin >> a >> b;
    auto iter = lower_bound(vc.begin(), vc.end(), pair<int, int>(a, b));
    if (iter->first == a && iter->second == b) {
      cout << "Waste\n";
    } else {
      cout << str[(((a - 1) * m + b - (iter - vc.begin())) - 1) % 3] << endl;
    }
  }
  return 0;
}
