#include <bits/stdc++.h>

using namespace std;

int main(){
    int N;
    cin >> N;

    vector<long long> a(N), b(N), c(N);

    for(int i=0; i<N; i++){
        cin >> a[i] >> b[i] >> c[i];
    }

    int Q;
    cin >> Q;

    vector<int> P(Q);
    vector<long long> T(Q);

    vector<int> o(Q);

    for(int i=0; i<Q; i++){
        int Pi;
        long long Ti;
        cin >> Pi >> Ti;
        //cin >> P[i] >> T[i];
        vector<pair<int, long long>> dist(N);
        for(int j=0; j<N; j++){
            dist[j].first = j;
            dist[j].second = a[j] * Ti * Ti + b[j] * Ti + c[j];
        }

        sort(dist.begin(), dist.end(), [](pair<int, long long> a, pair<int, long long> b){
            return a.second > b.second;
        });

        o[i] = dist[Pi-1].first;


        //for(int j=0; j<N; j++) if(dist[j].first == Pi-1)

        //cout << /*dist[0].second << "; " << dist[1].second <<*/ endl;


    }

    for(int i=0; i<Q; i++) cout << o[i] + 1 << "\n";

    return 0;
}