#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

mint get(long long n,long long r){
	if(r>n)return 0;
	mint ret = 1;
	rep(i,r){
		ret *= n-i;
		ret /= i+1;
	}
	return ret;
}

int main(){
	vector dp(9,vector(5,vector<mint>(34,0)));
	dp[0][0][0] = 1;
	rep(i,5){
		rep(j,34){
			long long v;
			cin>>v;
			vector ndp = dp;
			rep(k,9){
				rep(l,5){
					rep(m,34){
						rep(n,9){
							if(n==0)continue;
							if(k+n<9&&l+i*n<5&&m+j*n<34){
								ndp[k+n][l+i*n][m+j*n] += dp[k][l][m]*get(v,n);
							}
						}
					}
				}
			}
			swap(dp,ndp);
		}
	}
	mint ans = 0;
	rep(i,5){
		rep(j,34){
			long long v;
			cin>>v;
			if(j!=0)continue;
			mint t = dp[8][4-i][33-j];
			ans += t * v;
			
		}
	}
	cout<<ans.val()<<endl;
	return 0;
}