#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;


template <class Flow> struct MaxFlow {
  // Watch out when using types other than int and long long.
  static constexpr Flow FLOW_EPS = 1e-10L;
  static constexpr Flow FLOW_INF = std::numeric_limits<Flow>::max();
  
  int n, m;
  vector<int> ptr, nxt, zu;
  vector<Flow> capa;

  explicit MaxFlow(int n_) : n(n_), m(0), ptr(n_, -1) {}
  void ae(int u, int v, Flow w0, Flow w1 = 0) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(0 <= w0);
    assert(0 <= w1);
    nxt.push_back(ptr[u]); zu.push_back(v); capa.push_back(w0); ptr[u] = m++;
    nxt.push_back(ptr[v]); zu.push_back(u); capa.push_back(w1); ptr[v] = m++;
  }

  vector<int> see, lev, que;

  Flow augment(int u, int t, Flow limFlow) {
    if (u == t) return limFlow;
    for (int &i = see[u]; ~i; i = nxt[i]) if (capa[i] > FLOW_EPS) {
      const int v = zu[i];
      if (lev[u] < lev[v]) {
        const Flow f = augment(v, t, min(limFlow, capa[i]));
        if (f > FLOW_EPS) { capa[i] -= f; capa[i ^ 1] += f; return f; }
      }
    }
    return 0;
  }
  bool bfs(int s, int t) {
    for (int u = 0; u < n; ++u) { see[u] = ptr[u]; lev[u] = -1; }
    auto head = que.begin(), tail = que.begin();
    for (lev[*tail++ = s] = 0; head != tail; ) {
      const int u = *head++;
      for (int i = ptr[u]; ~i; i = nxt[i]) if (capa[i] > FLOW_EPS) {
        const int v = zu[i];
        if (!~lev[v]) {
          lev[*tail++ = v] = lev[u] + 1;
          if (v == t) return true;
        }
      }
    }
    return false;
  }
  Flow run(int s, int t, Flow limFlow = FLOW_INF) {
    see.resize(n); lev.resize(n); que.resize(n);
    Flow flow = 0;
    for (; flow + FLOW_EPS < limFlow && bfs(s, t); ) {
      for (Flow f; (f = augment(s, t, limFlow - flow)) > FLOW_EPS; flow += f) {}
    }
    return flow;
  }
};

////////////////////////////////////////////////////////////////////////////////


// det(a + x I)
// O(n^3)
//   Call by value: Modifies a (Watch out when using C-style array!)
template <class T> vector<T> charPoly(vector<vector<T>> a) {
  const int n = a.size();
  // upper Hessenberg
  for (int j = 0; j < n - 2; ++j) {
    for (int i = j + 1; i < n; ++i) {
      if (a[i][j]) {
        swap(a[j + 1], a[i]);
        for (int ii = 0; ii < n; ++ii) swap(a[ii][j + 1], a[ii][i]);
        break;
      }
    }
    if (a[j + 1][j]) {
      const T s = 1 / a[j + 1][j];
      for (int i = j + 2; i < n; ++i) {
        const T t = s * a[i][j];
        for (int jj = j; jj < n; ++jj) a[i][jj] -= t * a[j + 1][jj];
        for (int ii = 0; ii < n; ++ii) a[ii][j + 1] += t * a[ii][i];
      }
    }
  }
  // fss[i] := det(a[0..i][0..i] + x I_i)
  vector<vector<T>> fss(n + 1);
  fss[0] = {1};
  for (int i = 0; i < n; ++i) {
    fss[i + 1].assign(i + 2, 0);
    for (int k = 0; k <= i; ++k) fss[i + 1][k + 1] = fss[i][k];
    for (int k = 0; k <= i; ++k) fss[i + 1][k] += a[i][i] * fss[i][k];
    T prod = 1;
    for (int j = i - 1; j >= 0; --j) {
      prod *= -a[j + 1][j];
      const T t = prod * a[j][i];
      for (int k = 0; k <= j; ++k) fss[i + 1][k] += t * fss[j][k];
    }
  }
  return fss[n];
}

// det(a[0] + x a[1] + ... + x^m a[m])
// O((m n)^3)
//   Call by value: Modifies a (Watch out when using C-style array!)
template <class T> vector<T> detPoly(vector<vector<vector<T>>> a) {
  assert(!a.empty());
  const int m = a.size() - 1, n = a[0].size();
  T prod = 1;
  int off = 0;
  for (int h = 0; h < n; ++h) {
    for (; ; ) {
      if (a[m][h][h]) break;
      for (int j = h + 1; j < n; ++j) {
        if (a[m][h][j]) {
          prod = -prod;
          for (int d = 0; d <= m; ++d) for (int i = 0; i < n; ++i) {
            swap(a[d][i][h], a[d][i][j]);
          }
          break;
        }
      }
      if (a[m][h][h]) break;
      if (++off > m * n) return vector<T>(m * n + 1, 0);
      for (int d = m; --d >= 0; ) for (int j = 0; j < n; ++j) {
        a[d + 1][h][j] = a[d][h][j];
      }
      for (int j = 0; j < n; ++j) {
        a[0][h][j] = 0;
      }
      for (int i = 0; i < h; ++i) {
        const T t = a[m][h][i];
        for (int d = 0; d <= m; ++d) for (int j = 0; j < n; ++j) {
          a[d][h][j] -= t * a[d][i][j];
        }
      }
    }
    prod *= a[m][h][h];
    const T s = 1 / a[m][h][h];
    for (int d = 0; d <= m; ++d) for (int j = 0; j < n; ++j) {
      a[d][h][j] *= s;
    }
    for (int i = 0; i < n; ++i) if (h != i) {
      const T t = a[m][i][h];
      for (int d = 0; d <= m; ++d) for (int j = 0; j < n; ++j) {
        a[d][i][j] -= t * a[d][h][j];
      }
    }
  }
  vector<vector<T>> b(m * n, vector<T>(m * n, 0));
  for (int i = 0; i < (m - 1) * n; ++i) b[i][n + i] = -1;
  for (int d = 0; d < m; ++d) {
    for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
      b[(m - 1) * n + i][d * n + j] = a[d][i][j];
    }
  }
  const vector<T> fs = charPoly(b);
  vector<T> gs(m * n + 1, 0);
  for (int i = 0; off + i <= m * n; ++i) gs[i] = prod * fs[off + i];
  return gs;
}


/*
  f[i0][i1]: #{pair of disjoint paths from i0 and from i1}
  
  M = 3
  3: virtual point
  of 
     [                   +1 + x^2 f[0][1]  -1 + x^2 f[0][2]  +1 + x f[0][3] ]
  pf [ -1 + x^2 f[1][0]                    +1 + x^2 f[1][2]  -1 + x f[1][3] ]
     [ +1 + x^2 f[2][0]  -1 + x^2 f[2][1]                    +1 + x f[2][3] ]
     [ -1 + x   f[3][0]  +1 + x   f[3][1]  -1 + x   f[3][2]                 ]
  = 1 + O(x)
  
  M = 4
  4: virtual point, 5: never used
     [                   +1 + x^2 f[0][1]  -1 + x^2 f[0][2]  +1 + x^2 f[0][3]  -1 + x f[0][4]  +1 ]
     [ -1 + x^2 f[1][0]                    +1 + x^2 f[1][2]  -1 + x^2 f[1][3]  +1 + x f[1][4]  -1 ]
  pf [ +1 + x^2 f[2][0]  -1 + x^2 f[2][1]                    +1 + x^2 f[2][3]  -1 + x f[2][4]  +1 ]
     [ -1 + x^2 f[3][0]  +1 + x^2 f[3][1]  -1 + x^2 f[3][2]                    +1 + x f[3][4]  -1 ]
     [ +1 + x   f[4][0]  -1 + x   f[4][1]  +1 + x   f[4][2]  -1 + x   f[4][3]                  +1 ]
     [ -1                +1                -1                +1                -1                 ]
  = 1 + O(x)
*/

int M, N, K;
vector<int> A, B;
char S[410][410];

int id(int s, int x, int y) {
  return 2 + (x * K + y) * 2 + s;
}

int F;
Mint path[410][410];
Mint pathSum[410][410];

int main() {
  for (; ~scanf("%d%d%d", &M, &N, &K); ) {
    A.resize(M); for (int i = 0; i < M; ++i) { scanf("%d", &A[i]); --A[i]; }
    B.resize(N); for (int j = 0; j < N; ++j) { scanf("%d", &B[j]); --B[j]; }
    for (int x = 0; x < K; ++x) {
      scanf("%s", S[x]);
    }
    
    MaxFlow<int> mf(2 + 2 * K * K);
    for (int i = 0; i < M; ++i) mf.ae(0, id(0, 0, A[i]), 1);
    for (int j = 0; j < N; ++j) mf.ae(id(1, K - 1, B[j]), 1, 1);
    for (int x = 0; x < K; ++x) for (int y = 0; y < K; ++y) {
      if (x + 1 < K) mf.ae(id(1, x, y), id(0, x + 1, y), 1);
      if (y + 1 < K) mf.ae(id(1, x, y), id(0, x, y + 1), 1);
    }
    for (int x = 0; x < K; ++x) for (int y = 0; y < K; ++y) if (S[x][y] == '1') mf.ae(id(0, x, y), id(1, x, y), 1);
    F = mf.run(0, 1);
    
    memset(path, 0, sizeof(path));
    static Mint dp[410][410];
    for (int i = 0; i < M; ++i) {
      memset(dp, 0, sizeof(dp));
      dp[0][A[i]] = 1;
      for (int x = 0; x < K; ++x) for (int y = 0; y < K; ++y) if (S[x][y] == '1') {
        if (x + 1 < K && S[x + 1][y] == '1') dp[x + 1][y] += dp[x][y];
        if (y + 1 < K && S[x][y + 1] == '1') dp[x][y + 1] += dp[x][y];
      }
      for (int j = 0; j < N; ++j) {
        path[i][j] = dp[K - 1][B[j]];
      }
    }
    memset(pathSum, 0, sizeof(pathSum));
    for (int i = 0; i < M; ++i) {
      for (int j = 0; j < N; ++j) {
        pathSum[i][j + 1] = pathSum[i][j] + path[i][j];
      }
    }
    
    const int m = (M % 2 != 0) ? (M + 1) : (M + 2);
    vector<vector<vector<Mint>>> mat(3, vector<vector<Mint>>(m, vector<Mint>(m, 0)));
    for (int i0 = 0; i0 < m; ++i0) for (int i1 = i0 + 1; i1 < m; ++i1) {
      const Mint s = ((i1 - i0 - 1) & 1) ? -1 : +1;
      mat[0][i0][i1] += s;
      mat[0][i1][i0] -= s;
    }
    for (int i0 = 0; i0 < M; ++i0) for (int i1 = i0 + 1; i1 < M; ++i1) {
      Mint t = 0;
      for (int j1 = 0; j1 < N; ++j1) {
        t += pathSum[i0][j1] * path[i1][j1] - path[i0][j1] * pathSum[i1][j1];
      }
      mat[2][i0][i1] += t;
      mat[2][i1][i0] -= t;
    }
    for (int i = 0; i < M; ++i) {
      const Mint t = pathSum[i][N];
      mat[1][i][M] += t;
      mat[1][M][i] -= t;
    }
    
    const auto ps = detPoly(mat);
// cerr<<"ps = "<<ps<<endl;
    assert(ps[0] == 1);
    vector<Mint> qs(m + 1, 0);
    qs[0] = 1;
    for (int k = 1; k <= m; ++k) {
      Mint t = ps[k];
      for (int l = 1; l < k; ++l) t -= qs[l] * qs[k - l];
      qs[k] = t / 2;
    }
// cerr<<"qs = "<<qs<<endl;
    printf("%d %u\n", F, qs[F].x);
  }
  return 0;
}