import sys
input = sys.stdin.readline
from heapq import heappush, heappop
inf = float('inf')


def dijkstra(s, g, N, val):
    # ゴールがない場合はg=-1とする。

    def cost(v, m):
        return v * N + m

    dist = [inf] * N
    mindist = [inf] * N
    seen = [False] * N
    Q = [cost(val, s)]
    while Q:
        c, m = divmod(heappop(Q), N)
        if seen[m]:
            continue
        seen[m] = True
        dist[m] = c
        if m == g:
            return dist

        #------heapをアップデートする。--------
        for u, C in G[m]:
            if seen[u]:
                continue
            newdist = max(dist[m], C)

            #------------------------------------
            if newdist >= mindist[u]:
                continue
            mindist[u] = newdist
            heappush(Q, cost(newdist, u))
    return dist



def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    return arr


N, M = map(int, input().split())
A = list(map(int, input().split()))
Edge = []
for i in range(M):
    u, v = map(int, input().split())
    u, v = u - 1, v - 1
    Edge.append((u, v))

from collections import *
D = [defaultdict(int) for _ in range(N)]
ma = defaultdict(int)
for i in range(N):
    for k, v in factorization(A[i]):
        ma[k] = max(ma[k], v)
        D[i][k] = v    

ans = 1
mod = 998244353
ans = [1] * N
for k, v in ma.items():
    G = [[] for i in range(N)]
    for a, b in Edge:
        G[a].append((b, D[b][k]))
        G[b].append((a, D[a][k]))
        
    DD = dijkstra(0, -1, N, D[0][k])
    for i in range(N):
        ans[i] *= pow(k, DD[i], mod)
        ans[i] %= mod
        
for a in ans:
    print(a)