#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
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 (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

template<int mod> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % mod) {
        if (val < 0) val += mod;
    }
    constexpr int getmod() { return mod; }
    constexpr Fp operator - () const noexcept {
        return val ? mod - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= mod) val -= mod;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += mod;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % mod;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = mod, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % mod;
        if (val < 0) val += mod;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr istream& operator >> (istream &is, const Fp<mod>& x) noexcept {
        int val; is >> val;
        x = Fp<mod>(val);
        return is;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<mod>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<mod> modpow(const Fp<mod> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};

//const int mod = 1e9+7;
const int mod = 998244353;
using mint = Fp<mod>;

struct factorizer{
    vector<bool> isprime;
    vector<ll> primes;
    factorizer(ll n) : isprime(sqrtl(n)+1,true){
        isprime[1] = false;
        for(ll i = 2; i*i <= n; i++){
            if(!isprime[i]) continue;
            primes.pb(i);
            for(ll j = i+i; j*j <=n; j += i){
                isprime[j] = false;
            }
        }
    }

    vector<pair<ll,int>> factorize(ll n){
        vector<pair<ll,int>> res;
        for(ll p : primes){
            if(p * p > n) break;
            int e = 0;
            while(n%p == 0){
                n /= p;
                e++;
            }
            if(e > 0) res.pb({p,e});
        }
        if(n > 1) res.pb({n,1});
        return res;
    }
    
    vector<ll> divisors(ll n){
        vector<ll> res({1});
        const auto& pf = factorize(n);
        for(auto p : pf){
            for(ll x : res){
                ll v = 1;
                rep(j,p.second){
                    v *= p.first;
                    res.pb(x * v);
                }
            }
        }
        return res;
    }
};

#include "atcoder/dsu.hpp"

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m; in(n,m);
    factorizer f(mod);
    map<int,int> mp[n];
    vector<int> pfs;
    rep(i,n){
        int a; in(a);
        auto v = f.factorize(a);
        for(auto [p,e] : v){
            pfs.pb(p);
            mp[i][p] = e;
        }
    }
    vector<P> uv;
    rep(i,m){
        int u,v; in(u,v); u--; v--;
        uv.pb({u,v});
    }
    sort(ALL(pfs)); UNIQUE(pfs);
    vector<mint> ans(n,1);
    for(int pf : pfs){
        atcoder::dsu d(n);
        vector<tuple<int,int,int>> ed;
        rep(i,m){
            auto [u,v] = uv[i];
            ed.pb({max(mp[u][pf],mp[v][pf]),u,v});
        }
        sort(ALL(ed));
        vector<vector<P>> g(n);
        rep(i,m){
            auto [w,u,v] = ed[i];
            if(!d.same(u,v)){
                g[u].pb({v,w});
                g[v].pb({u,w});
                d.merge(u,v);
            }
        }
        vector<int> c(n,-1);
        c[0] = mp[0][pf];
        queue<int> q;
        q.push(0);
        while(q.size()){
            int x = q.front(); q.pop();
            for(auto [y,z]: g[x]){
                if(c[y] == -1){
                    c[y] = max(c[x],z);
                    q.push(y);
                }
            }
        }
        rep(i,n) ans[i] *= modpow((mint)pf, c[i]);
    }
    rep(i,n) out(ans[i]);
}