#include <bits/stdc++.h>
using namespace std;
long long maxi = 1000000000000000;
vector<long long> waste[100005];
long long row[100005];
int32_t main() {
  long long n, m, k, t;
  cin >> n >> m >> k >> t;
  long long x, y;
  for (long long i = 0; i < k; i++) {
    cin >> x >> y;
    waste[x].push_back(y);
    row[x]++;
  }
  for (long long i = 1; i <= 100000; i++) {
    row[i] = m - row[i];
    row[i] += row[i - 1];
    sort(waste[i].begin(), waste[i].end());
  }
  for (long long i = 0; i < t; i++) {
    cin >> x >> y;
    long long prev = row[x - 1];
    long long count = 0, foo = 0;
    for (long long j = 0; j < waste[x].size(); j++) {
      if (waste[x][j] == y)
        foo = 1;
      else if (waste[x][j] < y)
        count++;
      else
        break;
    }
    long long cur = y - count;
    if (foo == 1) {
      cout << "Waste" << endl;
    } else {
      prev += cur;
      prev %= 3;
      if (prev == 1) {
        cout << "Carrots" << endl;
      } else if (prev == 2) {
        cout << "Kiwis" << endl;
      } else {
        cout << "Grapes" << endl;
      }
    }
  }
  return 0;
}
