#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>ostream&operator<<(ostream &o,const vector<T>&t){o<<'[';FOR(i,t){if(i!=t.begin())o<<',';o<<*i;}return o<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)output(a[i],i!=n-1?',':10);}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}

ll extgcd(ll a, ll b, ll &x, ll &y) {
  ll g = a;
  x = 1; y = 0;
  if (b) {
    g = extgcd(b, a%b, y, x);
    y -= (a/b) * x;
  }
  return g;
}

ll invMod(ll a, ll p) {
  ll x, y;
  if (extgcd(a,p,x,y) == 1) return (x+p)%p;
  return 0;
}

// solve "ax == b (mod M)" for x
// (x, m)
bool divide(ll a, ll b, ll M, ll &x, ll &m) {
  // a %= M; b%= M;
  ll g = __gcd(a,M);
  if (b%g) return 0;
  // if g!=1, x has several answers.
  m = M/g;
  x = invMod(a/g, m)*(b/g)%m;
  return 1;
}
// 蟻本
bool linearCongruences(const vector<ll> &A, const vector<ll> &B,
                       const vector<ll> &M, ll &x, ll &m) {
  x=0; m=1;
  REP(i, A.size()) {
    ll a = A[i]*m, b=B[i]-A[i]*x;
    ll t, mm;
    if (!divide(a,b,M[i],t,mm)) return 0;
    x = x+m*t;
    m *= mm;
  }
  x = (x+m) % m;
  return 1;
}


int a[10];
int x[100][10];

int main() {
  int n,m,d;
  while(input(n,m,d)) {
    REP(i,m) {
      input(a[i]);
    }
    REP(i,d)REP(j,m)input(x[i][j]);
    bool ng = 0;
    ll cur = n;
    REP(i,d) {
      vector<ll> A, B, M;
      REP(j,m) {
        if (x[i][j] == -1) continue;
        A.push_back(1);
        B.push_back(x[i][j]);
        M.push_back(a[j]);
      }
      ll res, md;
      if (linearCongruences(A,B,M,res,md)) {
        if (res > cur) {
          ng = 1;
          break;
        }
        ll x = (cur - res) / md;
        cur = x * md + res;        
      } else {
        ng = 1;
        break;
      }
    }
    if (ng) cout << -1 << endl;
    else cout << cur << endl;
  }
}

Measured memory_bytes: 1180