#include <bits/stdc++.h>
using namespace std;
int main() {
  int waste[1000] = {0}, n, m, k, t;
  string output[1000];
  cin >> n >> m >> k >> t;
  for (int i = 0; i < k; i++) {
    int w1, w2;
    cin >> w1 >> w2;
    waste[i] = ((w1 - 1) * m) + w2;
  }
  sort(waste, &waste[k]);
  for (int i = 0; i < t; i++) {
    int current, num;
    int q1, q2;
    cin >> q1 >> q2;
    current = ((q1 - 1) * m) + q2;
    for (int j = (k - 1); j >= 0; j--) {
      if (current == waste[j]) {
        output[i] = "Waste";
        break;
      } else if (waste[j] < current || waste[0] > current) {
        if (waste[0] == 0 || waste[0] > current)
          num = 0;
        else
          num = j + 1;
        if (waste[0] == 0) num = j + 1;
        if ((current - num) % 3 == 1 || current == 1) {
          output[i] = "Carrots";
          break;
        }
        if ((current - num) % 3 == 2 || current == 2) {
          output[i] = "Kiwis";
          break;
        }
        if ((current - num) % 3 == 0 || current == 0) {
          output[i] = "Grapes";
          break;
        }
      }
    }
  }
  for (int i = 0; i < t; i++) {
    cout << output[i] << endl;
  }
  return 0;
}
