HDU1871+水～～

/*
水～～～
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<vector>
#include<math.h>
using namespace std;
typedef long long ll;
//typedef __int64 int64;
const int maxn = 105;
const int maxm = 1005;
const int inf = 0x7FFFFFFF;
const int CLEAR = 0x7F;
const double pi=acos(-1.0);
const double eps = 1e-8;
struct node{
    int id,num,val;
};
node a[ maxn ];
int cmp( node a,node b ){
    if( a.val!=b.val ) return a.val<b.val;
    else return a.num<b.num;
}
int main(){
    int ca;
    scanf("%d",&ca);
    while( ca-- ){
        int num;
        scanf("%d",&num);
        for( int i=1;i<=num;i++ ){
            scanf("%d%d%d",&a[i].id,&a[i].num,&a[i].val);
        }
        int num2,tt;
        scanf("%d",&num2);
        while( num2-- ){
            scanf("%d",&tt);
            int ans = inf;
            int id;
            int tmp;
            for( int i=1;i<=num;i++ ){
                if( a[i].num>=tt ){
                    if( ans>a[i].val ){
                        ans = a[i].val;
                        id=a[i].id;
                        tmp = i;
                    }
                }
            }
            if( ans!=inf ){
                a[ tmp ].num-=tt;
                printf("%d\n",id);
            }
            else{
                printf("sorry\n");
            }
        }
    }
    return 0;
}