#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  vector<pair<int, int>> vec;
  for (int i = 0; i < k; ++i) {
    int x, y;
    cin >> x >> y;
    vec.push_back({x, y});
  }
  for (int i = 0; i < t; ++i) {
    int a, b;
    cin >> a >> b;
    if (find(vec.begin(), vec.end(), make_pair(a, b)) != vec.end()) {
      cout << "Waste";
    } else {
      int wasted = 0;
      int before = ((a - 1) * m) + b;
      for (int i = 0; i < k; ++i) {
        int c = vec[i].first, d = vec[i].second;
        int wasted_before = ((c - 1) * m) + d;
        if (wasted_before < before) {
          wasted++;
        }
      }
      before -= wasted;
      int ans = before % 3;
      if (ans == 1) {
        cout << "Carrots";
      } else if (ans == 2) {
        cout << "Kiwis";
      } else {
        cout << "Grapes";
      }
    }
    cout << endl;
  }
  return 0;
}
