#include <cstdio>#include <vector>using namespace std;const long long MOD = 1000000007LL;vector<int> p;long long gao(int n, int x, long long y) {if (n == 0) {return y/x;} else {return gao(n - 1, x, y) + gao(n - 1, x * -p[n - 1], y);}}long long gao(int x, long long y) {p.clear();for (int i = 2; i * i <= x; ++i) {if (x % i == 0) {p.push_back(i);while (x % i == 0) {x /= i;}}}if (x > 1) {p.push_back(x);}return gao(p.size(), 1, y);}int main() {int n, s, t, a;long long x, y;while (scanf("%d%d%d%lld%lld", &n, &s, &t, &x, &y) != EOF) {vector<long long> dp(t + 1, 0);dp[0] = 1LL;--x;for (int i = 0; i < n; ++i) {vector<long long> pre(t + 1, 0);vector<pair<int, long long> > cnt;pre.swap(dp);scanf("%d", &a);for (int b = 1; b * b <= a; ++b) {if (a % b == 0) {int c = a / b;cnt.push_back(make_pair(b, gao(c, y / b) - gao(c, x / b)));if (a / b > b) {cnt.push_back(make_pair(c, gao(b, y / c) - gao(b, x / c)));}}}for (int j = 0; j <= t; ++j) {for (int k = 0; k < (int)cnt.size(); ++k) {if (j + cnt[k].first <= t) {dp[j + cnt[k].first] = (dp[j + cnt[k].first] + pre[j] * cnt[k].second) % MOD;}}}}long long ans = 0;for (int j = s; j <= t; ++j) {ans += dp[j];}printf("%lldn", ans % MOD);}return 0;}
