#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, q, k;
vector<pair<int, int> > vp;
map<pair<int, int>, int> mp;
int main() {
  cin >> n >> m;
  cin >> k >> q;
  while (k--) {
    cin >> x >> y;
    vp.push_back({x, y});
    pair<int, int> p = {x, y};
    mp[p] = 1;
  }
  sort(vp.begin(), vp.end());
  while (q--) {
    cin >> x >> y;
    pair<int, int> p = {x, y};
    if (mp[p]) {
      cout << "Waste" << endl;
      continue;
    }
    int idx = lower_bound(vp.begin(), vp.end(), p) - vp.begin();
    x--;
    int rem = ((x * m) + y - idx) % 3;
    if (rem & 1)
      cout << "Carrots" << endl;
    else if (!rem)
      cout << "Grapes" << endl;
    else
      cout << "Kiwis" << endl;
  }
  return 0;
}
