#include <bits/stdc++.h>
using namespace std;
int n, m;
struct kl {
  int x, y;
} a[1111];
struct kll {
  int x, y, z, m;
} b[1111];
bool cmp(kl p1, kl p2) { return p1.x < p2.x || (p1.x == p2.x && p1.y < p2.y); }
bool cmp1(kll p1, kll p2) {
  return p1.x < p2.x || (p1.x == p2.x && p1.y < p2.y);
}
bool cmp2(kll p1, kll p2) { return p1.z < p2.z; }
int main() {
  int x, y, z, k, i, j, t;
  cin >> n >> m >> k >> t;
  for (i = 0; i < k; i++) cin >> a[i].x >> a[i].y;
  sort(a, a + k, cmp);
  for (i = 0; i < t; i++) {
    cin >> b[i].x >> b[i].y;
    b[i].z = i + 1;
  }
  sort(b, b + t, cmp1);
  for (i = 0; i < t; i++) {
    int tp = (b[i].x - 1) * m + b[i].y;
    for (j = 0; j < k; j++)
      if (a[j].x > b[i].x || (a[j].x == b[i].x && a[j].y >= b[i].y)) break;
    tp -= j;
    if (a[j].x == b[i].x && a[j].y == b[i].y)
      b[i].m = -1;
    else
      b[i].m = tp % 3;
  }
  sort(b, b + t, cmp2);
  for (i = 0; i < t; i++)
    if (b[i].m == -1)
      cout << "Waste" << endl;
    else if (b[i].m == 1)
      cout << "Carrots" << endl;
    else if (b[i].m == 2)
      cout << "Kiwis" << endl;
    else if (b[i].m == 0)
      cout << "Grapes" << endl;
}
