#include <bits/stdc++.h>
using namespace std;
const int MAX = 4 * (1e4) + 10;
int n, m;
int k, t;
int num_waste[MAX];
vector<int> waste[MAX];
string crop(int n) {
  n %= 3;
  string str;
  if (n == 1) str = "Carrots";
  if (n == 2) str = "Kiwis";
  if (n == 0) str = "Grapes";
  return str;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m >> k >> t;
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    waste[x].push_back(y);
  }
  int sum = 0;
  for (int i = 2; i <= n; i++) {
    sum += waste[i - 1].size();
    num_waste[i] = sum;
  }
  for (int i = 0; i < t; i++) {
    int x, y;
    cin >> x >> y;
    int pos = (x - 1) * m + y - num_waste[x];
    if (waste[x].empty()) {
      cout << crop(pos) << endl;
    } else {
      int size = (int)waste[x].size();
      vector<int>::iterator first = waste[x].begin();
      vector<int>::iterator last = waste[x].end();
      sort(first, last);
      int ind = lower_bound(first, last, y) - first;
      if (ind != size && !(y < waste[x][ind]))
        cout << "Waste" << endl;
      else {
        pos -= ind;
        cout << crop(pos) << endl;
      }
    }
  }
  return 0;
}
