#include <bits/stdc++.h>
using namespace std;
inline int Read() {
  char c = getchar();
  int num = 0;
  while ('0' > c || c > '9') c = getchar();
  while ('0' <= c && c <= '9') num = num * 10 + c - '0', c = getchar();
  return (num);
}
int f[2][400010], n, a[400010], b[400010], mx[400010], p[400010], x, c[400010];
struct Big {
  char s[10010];
  int a[10010], ln;
  inline void Get() {
    scanf("%s", s + 1);
    int len = strlen(s + 1);
    for (int i = len; i > 0; i -= 8) {
      ln++;
      for (int j = max(1, i - 8 + 1); j <= i; j++)
        a[ln] = a[ln] * 10 + s[j] - '0';
    }
  }
  inline int Div(int d) {
    long long res = 0;
    for (int i = ln; i; i--) {
      res = res * 1ll * 100000000 + a[i];
      a[i] = res / d, res %= d;
    }
    while (!a[ln] && ln > 0) ln--;
    return (res);
  }
  inline bool Zero() { return (ln == 0); }
} m;
inline void Add(int &x, int y) {
  x += y;
  if (x < 0) x += 1000000007;
  if (x >= 1000000007) x -= 1000000007;
}
int main() {
  n = Read(), a[1] = 1;
  for (int i = 2; i <= n; i++) a[i] = Read();
  for (int i = 1; i <= n; i++) b[i] = Read();
  m.Get();
  a[n + 1] = 1e9;
  for (int i = 1; i <= n; i++) {
    if (a[i + 1] != 1)
      p[i] = m.Div(a[i + 1]);
    else
      p[i] = p[i - 1];
    mx[i] = (mx[i - 1] + b[i - 1]) / a[i];
  }
  while (!m.Zero()) {
    a[(++n) + 1] = 1e9;
    p[n] = m.Div(a[n + 1]);
    mx[n] = mx[n - 1] / a[n];
  }
  for (int i = n; i >= 1; i--)
    if (a[i + 1] != 1)
      c[i] = a[i + 1];
    else
      c[i] = c[i + 1];
  f[x][0] = 1;
  if (mx[1] >= 1) f[x][1] = 1000000007 - 1;
  for (int i = 1; i <= n; i++) {
    for (int vs = 0, j = 0; j <= mx[i]; j++) {
      Add(vs, f[x][j]), f[x][j] = 0;
      if (!vs) continue;
      if (a[i + 1] == 1) {
        int l = 0, r = b[i];
        Add(f[x ^ 1][j + l], vs);
        if (j + r + 1 <= mx[i + 1]) Add(f[x ^ 1][j + r + 1], -vs);
        continue;
      }
      int l = ((p[i] - j) % c[i] + c[i]) % c[i];
      int r = (b[i] - l) / c[i] * c[i] + l;
      if (l > b[i]) continue;
      l = (l + j) / c[i];
      if (l <= mx[i + 1]) Add(f[x ^ 1][l], vs);
      r = (r + j) / c[i];
      if (r + 1 <= mx[i + 1]) Add(f[x ^ 1][r + 1], -vs);
    }
    x ^= 1;
  }
  printf("%d\n", f[x][0]);
}
