int main() {
    scanf("%d%d%d%d", &I, &J, &K, &T);
    v.resize(I + 1);
    rep(i,K) {
        scanf("%d%d", &ii, &jj);
        v[ii].pb(jj);
    }
    rep2(i,1,I+1) {
        sort(all(v[i]));
        acc[i] = acc[i - 1] + sz(v[i]);
    }
    string s[3] = { "Carrots", "Kiwis", "Grapes" };
    rep(i,T) {
        scanf("%d%d", &ii, &jj);
        int ind = lower_bound(all(v[ii]),jj) - v[ii].begin();
        if (ind < sz(v[ii]) && v[ii][ind] == jj) {
            printf("Waste\n");
            continue;
        }
        ind += acc[ii - 1];
        int tot = (ii - 1) * J + jj;
        tot -= ind;
        tot--;
        tot %= 3;
        printf("%s\n", s[tot].c_str());
    }
    return 0;
}