func_code_string: #include <bits/stdc++.h>   using namespace std;   const int INF = 2147483647;   const double PI = 3.141592653589793;   const int N = 40005;   map<pair<int, int>, int> mapa;   int n, m, k, t, a, b, c, pocz[N], waste[N], r, i;   int main() {     scanf( %d %d %d %d , &n, &m, &k, &t);     for (i = 0; i < n; i++) waste[i] = 0;     mapa.clear();     while (k--) {       scanf( %d %d , &a, &b);       a--;       b--;       mapa[pair<int, int>(a, b)] = 1;       waste[a]++;     }     pocz[0] = 0;     for (i = 1; i < n; i++) pocz[i] = (pocz[i - 1] + m - waste[i - 1]) % 3;     while (t--) {       scanf( %d %d , &a, &b);       a--;       b--;       if (mapa.count(pair<int, int>(a, b)) > 0)         printf( Waste n );       else {         c = 0;         while (mapa.count(pair<int, int>(a, c)) > 0) c++;         r = pocz[a];         while (c != b) {           c++;           while (mapa.count(pair<int, int>(a, c)) > 0) c++;           r = (r + 1) % 3;         }         if (r == 0)           printf( Carrots n );         else if (r == 1)           printf( Kiwis n );         else           printf( Grapes n );       }     }     return 0;   }   