#include <bits/stdc++.h>
using namespace std;

long long mod = 998244353;
//入力が必ずmod未満の時に使う.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a;} mint(long long a){v = a;} mint(unsigned long long a){v = a;}
    long long val(){return v;}
    void modu(){v %= mod;}
 
    mint repeat2mint(const long long a,long long b){
        mint ret = 1,p = a;
        while(b){
            if(b&1) ret *= p;
            p *= p; b >>= 1;
        }
        return ret;
    };
 
    mint operator+(const mint b){return mint(v)+=b;}
    mint operator-(const mint b){return mint(v)-=b;}
    mint operator*(const mint b){return mint(v)*=b;}
    mint operator/(const mint b){return mint(v)/=b;}
 
    mint operator+=(const mint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    mint operator-=(const mint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    mint operator*=(const mint b){v = v*b.v%mod; return *this;}
    mint operator/=(mint b){
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
 
    mint operator++(int){*this += 1; return *this;}
    mint operator--(int){*this -= 1; return *this;}
    bool operator==(const mint b){return v == b.v;}
    bool operator!=(const mint b){return v != b.v;}
    bool operator>(const mint b){return v > b.v;}
    bool operator>=(const mint b){return v >= b.v;}
    bool operator<(const mint b){return v < b.v;}
    bool operator<=(const mint b){return v <= b.v;}
    
    mint pow(const long long x){return repeat2mint(v,x);}
    mint inv(){return mint(1)/v;}
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int Limit = 10;
    vector<mint> inv(Limit+1,1);
    for(int i=2; i<=Limit; i++) inv.at(i).v = mod-(mod/i*inv.at(mod%i).v %mod);
    auto nCr = [&](long long n,int r) -> mint {
        n %= mod;
        if(n < r || n < 0 || r < 0) return mint(0);
        mint ret = 1;
        while(r) ret *= n--,ret *= inv.at(r--);
        return ret;
    };

    vector dp(9,vector<vector<mint>>(5,vector<mint>(34)));
    dp.at(0).at(0).at(0) = 1;
    for(int a=0; a<5; a++) for(int b=0; b<34; b++){
        long long O; cin >> O;
        if(O == 0) continue;
        vector next = dp;
        int dx = 0,dy = 0;
        for(int use=1; use<=min(8LL,O); use++){
            mint mul = nCr(O,use);
            dx += a,dy += b;
            for(int i=0; i<9-use; i++) for(int x=0; x<=4-dx; x++) for(int y=0; y<=33-dy; y++){
                if(dp.at(i).at(x).at(y) == 0) continue;
                next.at(i+use).at(x+dx).at(y+dy) += dp.at(i).at(x).at(y)*mul;
            }
        }
        swap(next,dp);
    }
    mint answer = 0;
    for(int a=0; a<5; a++) for(int b=0; b<34; b++){
        long long X; cin >> X;
        X %= mod;
        if(b || X == 0) continue;
        answer += dp.at(8).at(4-a).at(33)*X;
    }
    cout << answer.v << endl;
}