#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;

long long  n,q;
long long  l[1005];
long long  r[1005];
long long  g[1005];
long long  t;
long long res[1005];
long long gcd(long long a,long long b)
{
    if(b==0) return a;
     return gcd(b,a%b);
}
int main()
{
    cin>>t;
    while(t--)
    {
        cin>>n>>q;
        for(long long  i=1;i<=n;i++)
        {
            res[i]=1;
        }
        bool flag=1;
        for(long long  i=0;i<q;i++)
        {
            cin>>l[i]>>r[i]>>g[i];
            for(long long  j=l[i];j<=r[i];j++)
            {
                res[j]=res[j]/gcd(res[j],g[i])*g[i];
                if(res[j]>1000000000||res[j]<1)
                {
                    flag=0;
                }
            }
        }

        for(long long  i=1;i<=n&&flag;i++)

            if(res[i]>1000000000||res[i]<1)
            {
                flag=0;
            }

        for(long long  i=0;i<q&&flag;i++)
        {
            long long gg=res[l[i]];
            for(long long  j=l[i]+1;j<=r[i];j++)

                gg=gcd(gg,res[j]);


            if(gg!=g[i])
                {
                    flag=0;
                    break;
                }
        }
        if(flag==0)
        {
            cout<<"Stupid BrotherK!"<<endl;
        }
        else
        {
            for(long long  i=1;i<=n-1;i++)
            {
                cout<<res[i]<<" ";
            }
            cout<<res[n]<<endl;
        }
    }
    return 0;
}