#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}


using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}


template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}


using P = pair<int, int>;

vector<P> factorize(int n){
    int m = n;
    vector<P> ans;
    for(int p = 2; p*p <= n; p++){
        if(m%p == 0){
            int cnt = 0;
            while(m%p == 0){
                m /= p;
                cnt++;
            }
            ans.push_back({p, cnt});
        }
    }
    if(m != 1){
        ans.push_back({m, 1});
    }
    return ans;
}

const int inf = 1e9;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    vector<int> a(n);
    set<int> st;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        for(auto [p, c]: factorize(a[i])){
            st.insert(p);
        }
    }
    vector<vector<int>> g(n);
    for(int i = 0; i < m; i++){
        int u, v; cin >> u >> v; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<mint> ans(n, mint(1));
    for(int p: st){
        vector<int> cnt(n);
        for(int i = 0; i < n; i++) {
            int x = a[i];
            while(x%p == 0){
                x /= p;
                cnt[i]++;
            }
        }
        vector<int> dist(n, inf);
        priority_queue<P, vector<P>, greater<P>> que;
        auto set_dist = [&](int v, int d){
            if(chmin(dist[v], d)){
                que.push({d, v});
            }
        };
        set_dist(0, cnt[0]);
        while(!que.empty()){
            auto [d, v] = que.top(); que.pop();
            if(dist[v] != d) continue;
            for(int to: g[v]){
                set_dist(to, max(d, cnt[to]));
            }
        }
        for(int i = 0; i < n; i++){
            ans[i] *= mint(p).pow(dist[i]);
        }
    }
    print_vector(ans, '\n');
}