#include <bits/stdc++.h>
using namespace std;
const int NMAX = 4 * 10001;
int main() {
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  vector<vector<int> > frees(n + 1);
  vector<int> sum(n + 1);
  int x, y;
  for (int i = 0; i < k; ++i) {
    cin >> x >> y;
    frees[x].push_back(y);
  }
  for (int i = 1; i <= n; ++i) {
    sort(frees[i].begin(), frees[i].end());
    sum[i] = frees[i].size() + sum[i - 1];
  }
  int ans;
  for (int i = 0; i < t; ++i) {
    cin >> x >> y;
    int cnt = 0;
    bool flag = false;
    for (int j = 0; j < frees[x].size(); ++j) {
      if (frees[x][j] == y) {
        cout << "Waste" << endl;
        flag = true;
      }
      if (frees[x][j] > y) break;
    }
    if (flag) continue;
    for (int j = 0; j < frees[x].size(); ++j) {
      if (frees[x][j] < y)
        ++cnt;
      else
        break;
    }
    ans = ((x - 1) * m + y - sum[x - 1] - cnt) % 3 - 1;
    if (ans == 0)
      cout << "Carrots" << endl;
    else if (ans == 1)
      cout << "Kiwis" << endl;
    else
      cout << "Grapes" << endl;
  }
  return 0;
}
