#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, m, k, t;
  cin >> n >> m >> k >> t;
  long long int wastecells[k][2];
  for (long long int i = 0; i < k; i++) {
    cin >> wastecells[i][0] >> wastecells[i][1];
  }
  for (long long int i = 0; i < t; i++) {
    long long int a, b;
    cin >> a >> b;
    long long int precedingWasteCells = 0;
    int wasteflag = 0;
    for (long long int j = 0; j < k; j++) {
      if (wastecells[j][0] == a && wastecells[j][1] == b) {
        wasteflag = 1;
        break;
      } else if (wastecells[j][0] < a) {
        precedingWasteCells++;
      } else if (wastecells[j][0] == a && wastecells[j][1] < b) {
        precedingWasteCells++;
      }
    }
    long long int totalPrecedingCells = (a - 1) * (m) + b;
    long long int cell = totalPrecedingCells - precedingWasteCells;
    long long int ans = cell % 3;
    if (wasteflag == 1) {
      cout << "Waste" << endl;
    } else {
      if (ans == 1) {
        cout << "Carrots" << endl;
      } else if (ans == 2) {
        cout << "Kiwis" << endl;
      } else {
        cout << "Grapes" << endl;
      }
    }
  }
}
