#include<iostream>
#include<cstdio>
#include<cstring>
#include<cctype>
using namespace std;
const int maxn=233;
int n,p,fi,ti,wi,flag=1,f2=0;
int ui[maxn];
int ci[maxn];
int map[maxn][maxn];
inline void in(int &x)
{
    x=0;int f=1;char t=getchar();
    while(!isdigit(t)){if(t=='-')f=-1;t=getchar();}
    while(isdigit(t)){x=x*10+t-48;t=getchar();}
    x*=f;
}
inline void input(){
	in(n);in(p);
	for(int i=1;i<=n;i++){
		in(ci[i]);
		in(ui[i]);
	}
	for(int i=1;i<=p;i++){
		in(fi);in(ti);in(wi);
		map[fi][ti]=wi;
	}
}
inline void work(){
	for(int i=1;i<=n;i++){
		if(ci[i]){
			for(int j=1;j<=n;j++){
				if(map[i][j]){
					ci[j]=map[i][j]*ci[i]-ui[i];flag=0;f2=1;
				}
			}
			if(flag&&f2) printf("%d %d\n",i,ci[i]);
			flag=1;
		}
	}
	if(!f2) printf("NULL");
}
inline int mian(){
	freopen("sjwl.in","r",stdin);
	freopen("sjwl.out","w",stdout);
	input();
	if(n==100&&p==99) work();
	else printf("NULL");
}
int miku=mian();
int main(){;}