#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;
  }
};

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


template <class T> T pf(vector<vector<T>> a) {
  const int n = a.size();
  for (int i = 0; i < n; ++i) assert(!a[i][i]);
  for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) assert(a[j][i] == -a[i][j]);
  if (n % 2 != 0) return 0;
  T prod = 1;
  for (int h = 0; h < n; h += 2) {
    for (int i = h + 1; i < n; ++i) if (a[i][h]) {
      if (h + 1 != i) {
        prod = -prod;
        swap(a[h + 1], a[i]);
        for (int ii = h; ii < n; ++ii) swap(a[ii][h + 1], a[ii][i]);
      }
      break;
    }
    if (!a[h][h + 1]) return 0;
    prod *= a[h][h + 1];
    const T s = a[h][h + 1].inv();
    for (int j = h + 2; j < n; ++j) a[h][j] *= s;
    for (int j = h + 2; j < n; ++j) a[h + 1][j] *= s;
    for (int i = h + 2; i < n; ++i) {
      const T t0 = a[i][h + 1], t1 = a[i][h];
      if (t0) for (int j = h + 2; j < n; ++j) a[i][j] -= t0 * a[h][j];
      if (t1) for (int j = h + 2; j < n; ++j) a[i][j] += t1 * a[h + 1][j];
    }
  }
  return prod;
}


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]];
      }
    }
    
    assert(F == M);
    
    if (M % 2 != 0) {
      path[M][N] = 1;
      ++M;
      ++N;
    }
    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];
      }
    }
    vector<vector<Mint>> mat(M, vector<Mint>(M, 0));
    for (int i0 = 0; i0 < M; ++i0) for (int i1 = i0 + 1; i1 < M; ++i1) {
      /*
      for (int j0 = 0; j0 < N; ++j0) for (int j1 = j0 + 1; j1 < N; ++j1) {
        const Mint t = path[i0][j0] * path[i1][j1] - path[i0][j1] * path[i1][j0];
        mat[i0][i1] += t;
        mat[i1][i0] -= t;
      }
      */
      for (int j1 = 0; j1 < N; ++j1) {
        const Mint t = pathSum[i0][j1] * path[i1][j1] - path[i0][j1] * pathSum[i1][j1];
        mat[i0][i1] += t;
        mat[i1][i0] -= t;
      }
    }
    const Mint ans = pf(mat);
    printf("%d %u\n", F, ans.x);
  }
  return 0;
}