#include <bits/stdc++.h>
using namespace std;
inline void proc_status() {
  ifstream t("/proc/self/status");
  cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
       << endl;
}
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline T read() {
  register T sum(0), fg(1);
  register char ch(getchar());
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fg = -1;
  for (; isdigit(ch); ch = getchar()) sum = sum * 10 - '0' + ch;
  return sum * fg;
}
const int MOD = (int)1e9 + 7;
const int MAXM = 100, MAXV = 250;
int n, m, M = 0;
long long K;
int p[MAXM + 5], c[MAXM + 5];
inline void input() {
  n = read<int>(), m = read<int>(), K = read<long long>();
  for (int i = 1; i <= n; ++i) p[i] = read<int>();
  for (int i = 1; i <= m; ++i) chkmax(M, c[i] = read<int>());
}
struct vec {
  int f[MAXV + 5];
  inline int &operator[](int pos) { return f[pos]; }
  inline const int &operator[](int pos) const { return f[pos]; }
  inline vec operator+(const vec &rhs) const {
    static vec res;
    for (int i = 0; i < M; ++i) res[i] = ((*this)[i] + rhs[i]) % MOD;
    return res;
  }
  inline vec operator*(const vec &rhs) const {
    static int res[MAXV * 2 + 5];
    for (int i = 0; i < 2 * M; ++i) res[i] = 0;
    for (int i = 0; i < M; ++i)
      for (int j = 0; j < M; ++j)
        (res[i + j] += (long long)this->f[i] * rhs[j] % MOD) %= MOD;
    for (int i = 2 * M - 1; i >= M; --i)
      for (int j = 1; j <= m; ++j) (res[i - c[j]] += res[i]) %= MOD;
    static vec ret;
    for (int i = 0; i < M; ++i) ret[i] = res[i];
    return ret;
  }
  vec() { memset(f, 0, sizeof f); }
};
inline vec unit() {
  static vec ret;
  ret[0] = 1;
  return ret;
}
inline vec fpm(vec x, long long y) {
  vec res(unit());
  for (; y; y >>= 1, x = x * x)
    if (y & 1) res = res * x;
  return res;
}
inline void solve() {
  vec I;
  I[1] = 1;
  for (int i = 2 * M - 1; i >= M; --i)
    for (int j = 1; j <= m; ++j) (I[i - c[j]] += I[i]) %= MOD;
  static vec T;
  for (int i = 1; i <= n; ++i) T = T + fpm(I, p[i]);
  T = fpm(T, K);
  static int dp[MAXV + 5];
  for (int i = 0; i < M; ++i) dp[i] = T[i];
  for (int i = M - 1; i > 0; --i)
    for (int j = 1; j <= m; ++j) (dp[i - c[j]] += dp[i]) %= MOD;
  printf("%d\n", (dp[0] + MOD) % MOD);
}
int main() {
  input();
  solve();
  return 0;
}
