#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

struct Fast {
  Fast() {
    std::cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(10);
  }
} fast;

#define rep(i, a, b) for (int(i) = (a); (i) < (int)(b); (i)++)

using ll = long long;
using mint = modint998244353;
using P = pair<int, int>;

int main() {
  int n, m;
  cin >> n >> m;
  vector<ll> a(n);
  rep(i, 0, n) cin >> a[i];
  vector<vector<int>> g(n, vector<int>());
  rep(i, 0, m) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }

  set<ll> primes;
  rep(i, 0, n) {
    ll x = a[i];
    for (ll d = 2; d * d <= x; d += (d & 1) + 1) {
      if (x % d) continue;
      primes.insert(d);
      while (!(x % d)) x /= d;
    }
    if (x > 1) primes.insert(x);
  }

  ll amax = 0;
  rep(i, 0, n) amax = max(amax, a[i]);

  vector<mint> ans(n, 1);
  for (auto p : primes) {
    vector<int> c(n, 0), d(n, 100);
    rep(i, 0, n) {
      ll x = a[i];
      while (x % p == 0) {
        c[i]++;
        x /= p;
      }
    }
    priority_queue<P> pq;
    pq.push(P(-c[0], 0));
    d[0] = c[0];
    while (!pq.empty()) {
      auto p = pq.top();
      pq.pop();
      int x = p.second;
      if (-p.first > d[x]) continue;
      for (auto y : g[x]) {
        if (d[y] > max(d[x], c[y])) {
          d[y] = max(d[x], c[y]);
          pq.push(P(-d[y], y));
        }
      }
    }
    vector<mint> pow(100);
    pow[0] = 1;
    rep(i, 1, pow.size()) pow[i] = pow[i - 1] * p;
    rep(i, 0, n) ans[i] *= pow[d[i]];
  }

  rep(i, 0, n) cout << ans[i].val() << "\n";
}