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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

using lld = int64_t;

int mod;
int add(int a, int b) {
  assert(0 <= a and a < mod);
  assert(0 <= b and b < mod);
  return a + b >= mod ? a + b - mod : a + b;
}
int mul(lld a, lld b) {
  assert(0 <= a and a < mod);
  assert(0 <= b and b < mod);
  return static_cast<int>(a * b % mod);
}

using Mat = array<array<int, 5>, 5>;
Mat mul(const Mat &a, const Mat &b) {
  Mat c = {};
  for (int i = 0; i < 5; i++)
    for (int k = 0; k < 5; k++)
      for (int j = 0; j < 5; j++) {
        c[i][j] = add(c[i][j], mul(a[i][k], b[k][j]));
      }
  return c;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  Mat I = {};
  for (int i = 0; i < 5; i++)
    I[i][i] = 1;
  for (int i = 0; i < 5; i++)
    orange(all(I[i]));

  int n, m;
  while (cin >> n >> m >> mod) {
    Mat A = {}, B = {};
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < m; j++)
        cin >> A[i][j];
    }
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < m; j++)
        cin >> B[i][j];
    }

    vector<Mat> lef, rig;
    Mat rigprod = I;
    auto push = [&](const Mat &mat) {
      rigprod = mul(rigprod, mat);
      rig.emplace_back(mat);
    };
    auto pop = [&] {
      if (lef.empty()) {
        Mat p = I;
        for (const auto &mat : rig | views::reverse) {
          p = mul(mat, p);
          lef.push_back(p);
        }
        rig.clear();
        rigprod = I;
      }
      assert(!lef.empty());
      lef.pop_back();
    };
    
    auto getprod = [&] {
      if (lef.empty())
        return rigprod;
      return mul(lef.back(), rigprod);
    };

    vector<int> c(n + 1);
    for (int i = 1; i <= n; i++)
      cin >> c[i];

    push(A);
    for (int i = 1; i <= n; i++) {
      debug(i);
      for (auto &l : lef)
        debug(l[0][0]);
      for (auto &r : rig)
        debug(r[0][0]);
      debug(rigprod[0][0]);

      while (lef.size() + rig.size() > i - c[i])
        pop();
      assert(lef.size() + rig.size() == i - c[i]);

      debug(i);
      for (auto &l : lef)
        debug(l[0][0]);
      for (auto &r : rig)
        debug(r[0][0]);
      debug(rigprod[0][0]);

      auto M = mul(getprod(), B);
      push(M);
      if (i == n) {
        for (int a = 0; a < m; a++)
          for (int b = 0; b < m; b++)
            cout << M[a][b] << (b+1==m ? '\n' : ' ');
      }
    }


  }

  return 0;
}