#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long mod = (1e+9) + 7;
const long long sz = 2e5 + 9;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long a, long long b, long long m = mod) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % m;
    b = b >> 1;
    a = (a * a) % m;
  }
  return res;
}
void randVector(vector<long long> &rep, long long n) {
  for (long long i = 0; i < n; i++) {
    swap(rep[rand() % n], rep[rand() % n]);
  }
}
long long numOfDig(long long temp, int arr[]) {
  int n = 0, tt, i = 0;
  while (temp != 0) {
    tt = temp % 10;
    arr[i++] = tt;
    temp /= 10;
    n++;
  }
  arr[i] = 999;
  return n;
}
int largest = 0;
int smallest = 9;
void Digits(long long n) {
  largest = 0;
  smallest = 9;
  while (n) {
    int r = n % 10;
    largest = max(r, largest);
    smallest = min(r, smallest);
    n = n / 10;
  }
}
bool compare(pair<long long, long long> a, pair<long long, long long> b) {
  if (min(2 * a.first, a.second) - min(a.first, a.second) >
      min(2 * b.first, b.second) - min(b.first, b.second))
    return 1;
  else
    return 0;
}
int global = 0;
long long check(vector<pair<long long, long long> > waste,
                pair<long long, long long> a) {
  long long count = 0;
  for (long long ik = 0; ik < waste.size(); ik++) {
    if (a == waste.at(ik)) {
      global = 9;
      break;
    } else if (waste.at(ik).first < a.first)
      count++;
    else if (waste.at(ik).first == a.first && waste.at(ik).second <= a.second)
      count++;
  }
  return count;
}
void code() {
  long long n, m, k, t;
  cin >> n >> m >> k >> t;
  int x, y;
  vector<pair<long long, long long> > waste;
  for (long long i = 0; i < k; i++) {
    cin >> x >> y;
    waste.push_back(make_pair(x - 1, y - 1));
  }
  sort(waste.begin(), waste.end());
  for (long long i = 0; i < t; i++) {
    int x, y;
    cin >> x >> y;
    long long newt;
    pair<long long, long long> a;
    a.first = x - 1, a.second = y - 1;
    long long temp = check(waste, a);
    if (global == 9) {
      cout << "Waste" << '\n';
      global = 0;
    } else {
      x--, y--;
      long long blocks;
      if (x == 0)
        blocks = y + 1;
      else
        blocks = (x)*m + (y + 1);
      long long newb = blocks - temp;
      newt = newb % 3;
      if (newt == 0)
        cout << "Grapes" << '\n';
      else if (newt == 1)
        cout << "Carrots" << '\n';
      else if (newt == 2)
        cout << "Kiwis" << '\n';
    }
  }
}
void solve() { code(); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  clock_t beg = clock();
  solve();
  clock_t end = clock();
  return 0;
}
