#include <bits/stdc++.h>
using namespace std;
int main() {
  long long i, j, x, y, z, count = 1, sum = 0, n, m, q, t;
  cin >> n >> m >> q >> t;
  vector<long long> v;
  vector<pair<long long, long long> > pa;
  while (q--) {
    cin >> x >> y;
    long long j = ((x - 1) * m) + y;
    pa.push_back(make_pair(x, y));
    v.push_back(j);
  }
  sort(v.begin(), v.end());
  while (t--) {
    long long x, y;
    cin >> x >> y;
    bool ok = true;
    for (long long i = 0; i < pa.size(); i++) {
      if (x == pa[i].first && y == pa[i].second) {
        cout << "Waste" << endl;
        ok = false;
        break;
      }
    }
    if (ok) {
      long long j = ((x - 1) * m) + y;
      long long q = lower_bound(v.begin(), v.end(), j) - v.begin();
      j -= q;
      if (j % 3 == 1)
        cout << "Carrots" << endl;
      else if (j % 3 == 2)
        cout << "Kiwis" << endl;
      else if (j % 3 == 0)
        cout << "Grapes" << endl;
    }
  }
  return 0;
}
