#include <bits/stdc++.h>
using namespace std;
int main() {
  long long m, n, k, t;
  cin >> n >> m >> k >> t;
  vector<long long> wasteCells(k, 0);
  for (int i = 0; i < k; i++) {
    long long row, col;
    cin >> row >> col;
    wasteCells[i] = m * (row - 1) + (col - 1);
  }
  sort(wasteCells.begin(), wasteCells.end());
  for (long p = 0; p < t; p++) {
    long row, col;
    scanf("%ld %ld\n", &row, &col);
    long cellNumber = m * (row - 1) + (col - 1);
    long index = 0, wasteNumber = 0;
    while (index < k) {
      if (wasteCells[index] < cellNumber) {
        ++index;
      } else if (wasteCells[index] >= cellNumber) {
        break;
      }
    }
    if (wasteCells[index] == cellNumber) {
      puts("Waste");
    } else {
      long cropNumber = cellNumber - index;
      if (cropNumber % 3 == 0) {
        puts("Carrots");
      } else if (cropNumber % 3 == 1) {
        puts("Kiwis");
      } else if (cropNumber % 3 == 2) {
        puts("Grapes");
      } else {
        puts("Error");
      }
    }
  }
  return 0;
}
