#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1010;
const int M=3600;
typedef long long LL;
int T,tot,i,j,p,n,q,k,flag;
LL tmp;
int vis[32000],a[N][M],aa[N],f[N][M],ff[N],fff[N][10000],g[M],l[N],r[N];
int main()
{
    scanf("%d",&T);
    memset(vis,0,sizeof(vis));
    tot=0;
    for (i=2;i<=31622;i++)
        if (!vis[i])
        {
            g[++tot]=i;
            for (j=2;j<=31622/i;j++) vis[i*j]=1;
        }
    while (T--)
    {
        scanf("%d%d",&n,&q);
        memset(f,0,sizeof(f));
        memset(ff,0,sizeof(ff));
        memset(fff,0,sizeof(fff));
        memset(a,0,sizeof(a));
        memset(aa,0,sizeof(aa));
        flag=0;
        for (i=1;i<=q;i++)
        {
            scanf("%d%d%d",&l[i],&r[i],&tmp);
            j=1;
            while (tmp!=1)
            {
                k=0;
                while (tmp%g[j]==0) k++,tmp/=g[j];
                for (p=l[i];p<=r[i];p++)
                    if (k>f[p][j])
                    {
                        f[p][j]=k;
                        fff[p][++fff[p][0]]=j;
                    }
                a[i][j++]=k;
            }
            if (tmp!=1)
            {
                aa[i]=tmp;
                for (p=l[i];p<=r[i];p++)
                    if (ff[p]==0 || ff[p]==tmp) ff[p]=tmp;
                    else
                    {
                        flag=1;
                        break;
                    }
            }
        }
        for (i=1;i<=q && !flag;i++)
            for (j=1;j<=fff[l[i]][0];j++)
            {
                tmp=100;
                for (p=l[i];p<=r[i];p++) tmp=min((int)tmp,f[p][fff[l[i]][j]]);
                if (tmp!=a[i][fff[l[i]][j]])
                {
                    flag=1;
                    break;
                }
            }
        for (i=1;i<=n &&! flag;i++)
        {
            tmp=max(1,ff[i]);
            for (j=1;j<=tot;j++)
                for (p=1;p<=f[i][j];p++) tmp=(LL)tmp*g[j];
            if (tmp>1e9)
            {
                flag=1;
                break;
            }
            else ff[i]=tmp;
        }
        if (flag) printf("Stupid BrotherK!\n");
        else
        {
            for (i=1;i<n;i++) printf("%d ",ff[i]);
            printf("%d\n",ff[n]);
        }
    }
}