#include <bits/stdc++.h>

using namespace std;

int partition(vector<pair<int, long long>> &vec, int low, int high) {

    // Selecting last element as the pivot
    pair<int, long long> pivot = vec[high];

    // Index of elemment just before the last element
    // It is used for swapping
    int i = (low - 1);

    for (int j = low; j <= high - 1; j++) {

        // If current element is smaller than or
        // equal to pivot
        if (vec[j].second <= pivot.second) {
            i++;
            swap(vec[i], vec[j]);
        }
    }

    // Put pivot to its position
    swap(vec[i + 1], vec[high]);

    // Return the point of partition
    return (i + 1);
}

void quickSort(vector<pair<int, long long>> &vec, int low, int high) {

    // Base case: This part will be executed till the starting
    // index low is lesser than the ending index high
    if (low < high) {

        // pi is Partitioning Index, arr[p] is now at
        // right place
        int pi = partition(vec, low, high);

        // Separately sort elements before and after the
        // Partition Index pi
        quickSort(vec, low, pi - 1);
        quickSort(vec, pi + 1, high);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    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;

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

        quickSort(dist, 0, dist.size()-1);

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

        cout << dist[Pi-1].first+1 << "\n";


    }

    return 0;
}