#include "stdio.h"
#include "stdlib.h"

void QuickSort(unsigned long long* arr, int size){
    int pivot = 0;
    for (int i = 1; i < size; i++)
    {
        if(arr[pivot] < arr[i]){
            arr[pivot] ^= arr[pivot+1];
            arr[pivot+1] ^= arr[pivot];
            arr[pivot] ^= arr[pivot+1];
            pivot++;

            if(i != pivot){
                arr[pivot-1] ^= arr[i];
                arr[i] ^= arr[pivot-1];
                arr[pivot-1] ^= arr[i];
            }
        }
    }
    if(pivot > 1)        QuickSort(arr, pivot);
    if(pivot < size-2) QuickSort(arr + (pivot+1), size - (pivot+1) );
}

unsigned long long distance(unsigned long long a, unsigned long long b, unsigned long long c, unsigned long long t){
    return t*t*a + t*b + c;
}

int main()
{
    int n, q;
    scanf("%d", &n);
    int* arr = (int*)malloc(sizeof(int)*n*3);
    for (int i = 0; i < n; i++)
    {
        scanf("%d%d%d", arr + i, arr + i + n, arr + i + 2*n);
    }
    scanf("%d", &q);
    int* sol = (int*)malloc(sizeof(int)*q);
    unsigned long long* dis = (unsigned long long*)malloc(sizeof(unsigned long long)*n);

    for (int i = 0; i < q; i++)
    {
        int p, t;
        scanf("%d%d", &p, &t);
        for (int j = 0; j < n; j++)
        {
            dis[j] = distance(arr[j], arr[j+n], arr[j+2*n], t)*10000 + n-j; 
        }

        QuickSort(dis, n);
        sol[i] = n - dis[p-1]%10000 + 1;
    }
    for (int i = 0; i < q; i++)
    {
        printf("%d\n", sol[i]);
    }
    free(arr);
    free(sol);
    free(dis);
    return 0;
}