#include<stdio.h>
 #include<math.h>
 
 int gcd(int m,int n)
 {
     int temp;
     while(n)
     {
         temp=m%n;
         m=n;
         n=temp;
     }
     return m;
 }
 
 int main()
 {
     int T;
     scanf("%d",&T);
     while(T--)
     {
         int arr[1005];
         int N,Q;
         int aL[1005],aR[1005],ans;
         int L,R;
         int ques[1005];
         int pointer=1;
         bool flag;
         scanf("%d%d",&N,&Q);
         for(int i=1;i<=N;i++) arr[i]=1;
         for(int j=0;j<Q;j++)
         {
             scanf("%d%d%d",&L,&R,&ans);
             aL[j+1]=L,aR[j+1]=R;
             for(int i=L;i<=R;i++)
             {
                 arr[i]=arr[i]/gcd(ans,arr[i])*ans;
              } 
              ques[pointer++]=ans;
         }
         flag=false;
         int kk=1;
         int cerr;
         while(Q--)
         {
             cerr=arr[aL[kk]];
               for(int k=aL[kk];k<=aR[kk];k++)
               {
                   cerr=gcd(cerr,arr[k]);
               }
               if(cerr!=ques[kk])
               {
                       flag=true;
                       break;
              }
              kk++;
         }
         if(!flag) 
         {
             for(int i=1;i<N;i++) printf("%d ",arr[i]);
             printf("%d\n",arr[N]);
          } 
          else printf("Stupid BrotherK!\n");
     }
     return 0;
 }