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

__attribute__((constructor))
void fast_io() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

int main() {
    int r, c;
    cin >> r >> c;
    vector<int> a(r * (c - 1)), b((r - 1) * c), dist(2 * r * c, INT_MAX);
    for (int i = 0; i < r; ++i) for (int j = 0; j < c - 1; ++j) cin >> a[i * (c - 1) + j];
    for (int i = 0; i < r - 1; ++i) for (int j = 0; j < c; ++j) cin >> b[i * c + j];
    using P = pair<int, int>;
    priority_queue<P, vector<P>, greater<P>> pq;
    auto update = [&](int id, int d) {
        if (dist[id] > d) {
            dist[id] = d;
            pq.emplace(d, id);
        }
    };
    update(0, 0);
    while (!pq.empty()) {
        auto [d, id] = pq.top();
        pq.pop();
        if (dist[id] < d) continue;
        if (id >= r * c) {
            update(id - r * c, d);
            int i = (id - r * c) / c, j = (id - r * c) % c;
            if (i > 0) update((i - 1 + r) * c + j, d + 1);
        } else {
            int i = id / c, j = id % c;
            if (j < c - 1) update(i * c + j + 1, d + a[i * (c - 1) + j]);
            if (j > 0) update(i * c + j - 1, d + a[i * (c - 1) + j - 1]);
            if (i < r - 1) update((i + 1) * c + j, d + b[i * c + j]);
            update(id + r * c, d + 1);
        }
    }
    cout << dist[r * c - 1] << '\n';
}
    #include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    using P=pair<ll,ll>;
    const int INF=1001001001;
    const int mod=998244353;
    
    struct mint {
      ll x; 
      mint(ll x=0):x((x%mod+mod)%mod){}
      mint operator-() const { return mint(-x);}
      mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
      }
      mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
      }
      mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
      mint operator+(const mint a) const { return mint(*this) += a;}
      mint operator-(const mint a) const { return mint(*this) -= a;}
      mint operator*(const mint a) const { return mint(*this) *= a;}
      mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
      }
       
      mint inv() const { return pow(mod-2);}
      mint& operator/=(const mint a) { return *this *= a.inv();}
      mint operator/(const mint a) const { return mint(*this) /= a;}
     };
      istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
      ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
      struct combination {
      vector<mint> fact, ifact;
      combination(int n):fact(n+1),ifact(n+1) {
        assert(n < mod);
        fact[0] = 1;
        for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
        ifact[n] = fact[n].inv();
        for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
      }
      mint operator()(int n, int k) {
        if (k < 0 || k > n) return 0;
        return fact[n]*ifact[k]*ifact[n-k];
      }
     } c(2000005);

    int main() {
      int N,K;
      cin>>N>>K;
      vector<ll>A(N);
      rep(i,N){cin>>A[i];}
      vector<mint>sum(K+1);//sum[k]=A[0]^k+A[1]^k+A[2]^k+...
      rep(i,N){
        mint now=1;
        rep(j,K+1){
          sum[j]+=now;
          now*=A[i];
        }
      }
      for(int i=1;i<=K;i++){
        mint ans=0;
        for(int j=0;j<=i;j++){
          ans+=c(i,j)*sum[j]*sum[i-j];
        }
        ans-=mint(2).pow(i)*sum[i];
        ans/=2;
        cout<<ans<<endl;
      }
      return 0;
    }