#include <bits/stdc++.h>
using namespace std;
vector<int> row[100000];
int rcnt[100000];
int main() {
  string ans[] = {"Carrots", "Kiwis", "Grapes"};
  int n, m, k, t;
  scanf("%d%d%d%d", &n, &m, &k, &t);
  for (int i = 0; i < (k); i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--;
    y--;
    row[x].push_back(y);
  }
  for (int i = 0; i < (n); i++) {
    sort(row[i].begin(), row[i].end());
    rcnt[i] = m - row[i].size();
    if (i > 0) rcnt[i] += rcnt[i - 1];
  }
  for (int i = 0; i < (t); i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--;
    y--;
    if (binary_search(row[x].begin(), row[x].end(), y)) {
      printf("Waste\n");
    } else {
      int cnt = 0;
      if (x > 0) cnt += rcnt[x - 1];
      cnt +=
          y - (upper_bound(row[x].begin(), row[x].end(), y) - row[x].begin());
      cout << ans[cnt % 3] << "\n";
    }
  }
}
