Problem: There are n types of coins in Byteland. Conveniently, the denomination of the coin type k divides the denomination of the coin type k + 1, the denomination of the coin type 1 equals 1 tugrick. The ratio of the denominations of coin types k + 1 and k equals ak. It is known that for each x there are at most 20 coin types of denomination x.

Byteasar has bk coins of type k with him, and he needs to pay exactly m tugricks. It is known that Byteasar never has more than 3·105 coins with him. Byteasar want to know how many ways there are to pay exactly m tugricks. Two ways are different if there is an integer k such that the amount of coins of type k differs in these two ways. As all Byteland citizens, Byteasar wants to know the number of ways modulo 109 + 7.

Input

The first line contains single integer n (1 ≤ n ≤ 3·105) — the number of coin types.

The second line contains n - 1 integers a1, a2, ..., an - 1 (1 ≤ ak ≤ 109) — the ratios between the coin types denominations. It is guaranteed that for each x there are at most 20 coin types of denomination x.

The third line contains n non-negative integers b1, b2, ..., bn — the number of coins of each type Byteasar has. It is guaranteed that the sum of these integers doesn't exceed 3·105.

The fourth line contains single integer m (0 ≤ m < 1010000) — the amount in tugricks Byteasar needs to pay.

Output

Print single integer — the number of ways to pay exactly m tugricks modulo 109 + 7.

Examples

Input

1

4
2


Output

1


Input

2
1
4 4
2


Output

3


Input

3
3 3
10 10 10
17


Output

6

Note

In the first example Byteasar has 4 coins of denomination 1, and he has to pay 2 tugricks. There is only one way.

In the second example Byteasar has 4 coins of each of two different types of denomination 1, he has to pay 2 tugricks. There are 3 ways: pay one coin of the first type and one coin of the other, pay two coins of the first type, and pay two coins of the second type.

In the third example the denominations are equal to 1, 3, 9.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
const long long INF = 1e9 + 19;
const int SZ = 9;
const long long BASE = 1e9;
const int MOD = 1e9 + 7;
int n;
int a[N];
int b[N];
char s[N];
long long g[N];
long long val[N];
vector<int> cnt[N];
int step[N];
int cof[N];
void read() {
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  scanf("%s", s);
}
void solve() {
  int cur = 0;
  int len = strlen(s);
  for (; cur * SZ < len; cur++) {
    int u = min(len - cur * SZ, SZ);
    for (int i = 0; i < u; i++) {
      int pos = len - cur * SZ - u + i;
      g[cur] = g[cur] * 10 + s[pos] - '0';
    }
  }
  int m = 0;
  for (int i = 0; i < n;) {
    int j = i;
    for (; i + 1 < n && a[i] == 1; i++)
      ;
    i++;
    for (; j < i; j++) cnt[m].push_back(b[j]);
    if (i < n) {
      step[m] = a[i - 1];
    }
    m++;
  }
  long long sumCoin = 0;
  for (int i = 0; i < n; i++) sumCoin += b[i];
  for (int i = 0; i < m; i++) {
    long long rem = 0;
    if (i + 1 == m) {
      for (int j = cur - 1; j >= 0; j--) {
        rem = rem * BASE + g[j];
        if (rem > sumCoin) {
          puts("0");
          return;
        }
      }
    } else {
      for (int j = cur - 1; j >= 0; j--) {
        rem *= BASE;
        rem += g[j];
        g[j] = rem / step[i];
        rem = rem % step[i];
      }
    }
    cof[i] = rem;
    for (; cur > 0 && g[cur - 1] == 0; cur--)
      ;
  }
  vector<int> prev;
  prev.push_back(1);
  for (int i = 0; i < m; i++) {
    vector<vector<int>> dp(cnt[i].size() + 1);
    dp[0] = prev;
    for (int j = 0; j < (int)cnt[i].size(); j++) {
      int sz = dp[j].size() + cnt[i][j];
      dp[j + 1].resize(sz + 1);
      vector<int> pref(dp[j].size() + 1);
      for (int t = 0; t < (int)dp[j].size(); t++) {
        pref[t + 1] = (pref[t] + dp[j][t]) % MOD;
      }
      for (int t = 0; t < sz; t++) {
        int l = max(0, t - cnt[i][j]);
        int r = min((int)dp[j].size(), t + 1);
        dp[j + 1][t] = (pref[r] - pref[l] + MOD) % MOD;
      }
    }
    if ((int)dp.back().size() <= cof[i]) {
      puts("0");
      return;
    }
    if (i + 1 != m) {
      prev.clear();
      for (int t = cof[i]; t < (int)dp.back().size(); t += step[i])
        prev.push_back(dp.back()[t]);
    } else {
      printf("%d\n", dp.back()[cof[i]]);
    }
  }
}
void stress() {}
int main() {
  if (1) {
    read();
    solve();
  } else {
    stress();
  }
  return 0;
}