关于at&bound

#include <bits/stdc++.h>
#define SACRIFICING using
#define THE namespace
#define ROOK std
SACRIFICING THE ROOK;
typedef long long ll;
const ll mod=998244353;
int n;
ll a[200009];
int t;
ll lcmd;
int gcmd;
bool ispr[10000009];
int pr[2000009],l;
vector<int>prs[2000009];
struct node{
	vector<pair<int,int> >s;
}b[200009];
ll qpow(ll x,ll y){
	ll res=1;
	while(y){
		if(y&1){
			res*=x;
			res%=mod;
		}
		x*=x;
		x%=mod;
		y/=2;
	}
	return res;
} 
int N=1e7;
int main(){
	for(int i=2;i<=N;i++){
		if(!ispr[i]){
			pr[++l]=i;
		}
		//else continue;
		for(int j=2;j*i<=N;j++){
			ispr[i*j]=1;
			if(j%i==0)break;
		}
	}
	cin>>t;
	while(t--){
		for(int i=1;i<=l;i++){
			while(!prs[i].empty()){
				prs[i].pop_back();
			}
		}
		cin>>n;
		lcmd=gcmd=1;
		for(int i=1;i<=n;i++){
			cin>>a[i];
			while(!b[i].s.empty()){
				b[i].s.pop_back();
			}
			int x=a[i],y=1;
			while(x>1&&y<=l){
				while(y<=l&&x%pr[y]){
					y++;
				}
                if(y>l)break;
				int ti=0;
				while(!(x%pr[y])){
					x/=pr[y];
					++ti;
				}
				prs[i].push_back(ti);
				b[i].s.push_back({y,ti});
			}
			lcmd=a[i]*lcmd/__gcd(lcmd,a[i]);
			lcmd%=mod;
		}
		for(int i=1;i<=l;i++){
			if(!prs[i].empty())sort(prs[i].begin(),prs[i].end());
		}
		for(int i=1;i<=n;i++){	
			ll x=1;		
			for(pair<int,int>cur:b[i].s){
                cout<<a[i]<<' '<<cur.first<<' '<<cur.second<<'\n';
				int d;
                auto dd=lower_bound(prs[cur.first].begin(),prs[cur.first].end(),cur.second);
                dd--;
                if(dd>=prs[cur.first].begin()){
                    d=*dd;
                }
                else{
                    d=0;
                }
				x*=qpow(pr[cur.first],cur.second-d);
			}
			cout<<lcmd/x<<' ';
		}
        puts("");
	}
	return 0;
}