#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c > 57 || c < 48) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c > 47 && c < 58) x = x * 10 + c - 48, c = getchar();
  return x * f;
}
char s[10010];
long long w[300010];
int m, a[300010], b[300010], n;
vector<int> f[300010];
int calc(int a) {
  if (!m || a == 1) return 0;
  int t;
  for (int i = m - 1; i >= 0; i--) {
    t = w[i] % a;
    w[i] /= a;
    if (i) w[i - 1] += t * 1000000000ll;
  }
  while (m && !w[m - 1]) m--;
  return t;
}
int main() {
  n = read();
  for (int i = 2; i <= n; i++) a[i] = read();
  a[1] = 1;
  a[n + 1] = 2000000000;
  for (int i = 1; i <= n; i++) b[i] = read();
  scanf("%s", s);
  for (int i = strlen(s) - 1; i >= 0; i -= 9, m++)
    for (int j = max(0, i - 8); j <= i; w[m] = w[m] * 10 + s[j++] - '0')
      ;
  f[1].push_back(1);
  for (int i = 1; i <= n; i++)
    for (int s = f[i].size(), delta = calc(a[i + 1]), S = 0, j = 0;
         j <= s + b[i]; j++) {
      if (j < s) (S += f[i][j]) %= 1000000007;
      if (j > b[i]) (S -= f[i][j - b[i] - 1]) %= 1000000007;
      if (j % a[i + 1] == delta) f[i + 1].push_back(S);
    }
  printf("%d", m ? 0
               : f[n + 1].size() == 0
                   ? 0
                   : (f[n + 1][0] + 1000000007) % 1000000007);
  return 0;
}
