#include <bits/stdc++.h>
using namespace std;
int n, m, k, t;
vector<int> Waste;
int main() {
  cin >> n >> m >> k >> t;
  for (int i = 0, x, y; i < k; ++i) {
    cin >> x >> y;
    Waste.push_back(m * (x - 1) + y);
  }
  sort(Waste.begin(), Waste.end());
  for (int i = 0, x, y; i < t; ++i) {
    cin >> x >> y;
    int F = (m * (x - 1) + y);
    if (binary_search(Waste.begin(), Waste.end(), F)) {
      cout << "Waste\n";
      continue;
    }
    int P = upper_bound(Waste.begin(), Waste.end(), F) - Waste.begin();
    F -= P;
    if ((F - 1) % 3 == 0)
      cout << "Carrots\n";
    else if ((F - 2) % 3 == 0)
      cout << "Kiwis\n";
    else if ((F - 3) % 3 == 0)
      cout << "Grapes\n";
  }
  return 0;
}
