#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, k, t;
  cin >> n >> m >> k >> t;
  vector<pair<int, int> > v, query;
  vector<string> answer;
  for (int i = 0; i < k; i++) {
    int s1, s2;
    cin >> s1 >> s2;
    v.push_back({s1, s2});
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < t; i++) {
    int s1, s2;
    cin >> s1 >> s2;
    query.push_back({s1, s2});
  }
  for (int i = 0; i < t; i++) {
    if (count(v.begin(), v.end(), query[i]) > 0)
      answer.push_back("Waste");
    else {
      int cnt = 0;
      for (int j = 0; j < k; j++) {
        if (query[i] > v[j]) cnt = j + 1;
      }
      int av = (query[i].first - 1) * m + query[i].second - cnt;
      if (av % 3 == 1) answer.push_back("Carrots");
      if (av % 3 == 2) answer.push_back("Kiwis");
      if (av % 3 == 0) answer.push_back("Grapes");
    }
  }
  for (int i = 0; i < t; i++) cout << answer[i] << endl;
}
