MOD = 998244353

def inverse(n, d):
    return n * pow(d, -1, MOD) % MOD

def C(N, K):
    if N < K:
        return 0
    if N < K*2:
        K = N-K
    top = 1
    for i in range(N, N-K, -1):
        top *= i%MOD
        top %= MOD
    bottom = 1
    for i in range(1, K+1):
        bottom *= i%MOD
        bottom %= MOD
    return inverse(top, bottom)

O = [list(map(int, input().split())) for _ in range(5)]
X = [list(map(int, input().split())) for _ in range(5)]

dp = [[[0]*34 for _ in range(5)] for _ in range(9)]
dp[0][0][0] = 1
for i in range(5):
    for j in range(34):
        ndp = [[[0]*34 for _ in range(5)] for _ in range(9)]
        for k in range(9):
            for l in range(5):
                for m in range(34):
                    if dp[k][l][m] == 0: continue
                    for n in range(O[i][j]+1):
                        a, b, c = k+n, l+i*n, m+j*n
                        if 8 < a or 4 < b or 33 < c: break
                        ndp[a][b][c] += dp[k][l][m]*C(O[i][j], n)%MOD
                        ndp[a][b][c] %= MOD
        dp = ndp

ans = 0
for i in range(5):
    j = 4-i
    ans += dp[8][i][33]*(X[j][0]%MOD)%MOD
    ans %= MOD

print(ans)