#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
int A[250];
int B[250];
int D[250];
vector<int> E[2020];
ll ret[255];
const ll mo=998244353;

set<ll> enumpr(ll n) {
	set<ll> V;
	for(ll i=2;i*i<=n;i++) while(n%i==0) V.insert(i),n/=i;
	if(n>1) V.insert(n);
	return V;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	set<int> S;
	FOR(i,N) {
		cin>>A[i];
		auto a=enumpr(A[i]);
		FORR(v,a) S.insert(v);
		ret[i]=1;
	}
	FOR(i,M) {
		cin>>x>>y;
		E[x-1].push_back(y-1);
		E[y-1].push_back(x-1);
	}
	
	FORR(p,S) {
		FOR(i,N) {
			x=A[i];
			B[i]=0;
			D[i]=1<<20;
			while(x%p==0) {
				B[i]++;
				x/=p;
			}
		}
		priority_queue<pair<int,int>> Q;
		D[0]=B[0];
		Q.push({-D[0],0});
		while(Q.size()) {
			int co=-Q.top().first;
			int cur=Q.top().second;
			Q.pop();
			if(D[cur]!=co) continue;
			FORR(e,E[cur]) if(chmin(D[e],max(B[e],co))) Q.push({-D[e],e});
		}
		FOR(i,N) {
			FOR(j,D[i]) ret[i]=ret[i]*p%mo;
		}
	}
	FOR(i,N) cout<<ret[i]<<endl;
		
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}