#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll O[5][34], X[5][34];
  mint inv[10];
  rep(i, 10) if (i) inv[i] = mint(i).inv();
  auto comb = [&](ll n, int k) {
    mint res = 1;
    rep(i, k) res *= mint(n - i) * inv[i + 1];
    return res;
  };
  rep(a, 5) rep(b, 34) cin >> O[a][b];
  rep(a, 5) rep(b, 34) cin >> X[a][b];
  mint f[9][5][34];
  f[0][0][0] = 1;
  rep(a, 5) rep(b, 34) {
    rrep(p, 9) rrep(q, 5) rrep(r, 34) {
      for (int k = 0, np = p, nq = q, nr = r; np < 9 && nq < 5 && nr < 34; k++, np++, nq += a, nr += b) {
        if (k) f[np][nq][nr] += comb(O[a][b], k) * f[p][q][r];
      }
    }
  }
  mint ans;
  rep(a, 5) ans += f[8][4 - a][33] * X[a][0];
  cout << ans.val() << '\n';
}