#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  vector<pair<int, int>> waste;
  for (int i = 0; i < k; i++) {
    int a, b;
    cin >> a >> b;
    waste.push_back({a, b});
  }
  string s[] = {"Carrots", "Kiwis", "Grapes"};
  for (int i = 0; i < t; i++) {
    int a, b;
    cin >> a >> b;
    if (find(waste.begin(), waste.end(), make_pair(a, b)) != waste.end()) {
      cout << "Waste" << endl;
      continue;
    }
    int numwaste = 0;
    for (int i = 0; i < waste.size(); i++) {
      pair<int, int> w = waste[i];
      if (w.first < a)
        numwaste++;
      else if (w.first == a && w.second < b)
        numwaste++;
    }
    int index = (a - 1) * m + (b - 1) - numwaste;
    cout << s[index % 3] << endl;
  }
  return 0;
}
