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