#include #define rep(i,a) for(int i=(int)0;i<(int)a;++i) #define rrep(i,a) for(int i=(int)a-1;i>=0;--i) #define REP(i,a,b) for(int i=(int)a;i<(int)b;++i) #define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i) #define pb push_back #define eb emplace_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() typedef std::vector vi; typedef std::vector> vvi; typedef std::vector vl; typedef std::vector> vvl; using ll=long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 60; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } ll gcd(ll n, ll m) { ll tmp; while (m!=0) { tmp = n % m; n = m; m = tmp; } return n; } ll lcm(ll n, ll m) { return abs(n) / gcd(n, m)*abs(m);//gl=xy } using namespace std; ll dp[105][100005], dp2[105][100005]; void solve() { int n,m; cin >> n >> m; vector v(n), r(m); rep(i, n) cin >> v[i]; rep(i, m) cin >> r[i]; ll a, b; cin >> a >> b; memset(dp,0, sizeof(dp)); memset(dp2, 0, sizeof(dp2)); dp[0][0] = 1; dp2[0][0] = 1; rep(i, n) { rep(j,100001){ if(j+v[i]<=100000){ dp[i + 1][j + v[i]] += dp[i][j]; dp[i + 1][j + v[i]] %= mod; } dp[i + 1][j] += dp[i][j]; dp[i + 1][j] %= mod; } } rep(i,m){ rep(j,100001){ if(j+r[i]<=100000){ dp2[i + 1][j + r[i]] += dp2[i][j]; dp2[i + 1][j + r[i]] %= mod; } dp2[i + 1][j] += dp2[i][j]; dp2[i + 1][j] %= mod; } } ll ans = 0; vector sum(100005); rep(i,100000){ sum[i + 1] = sum[i] + dp[n][i+1]; sum[i + 1] %= mod; } for (ll i = 1; i <= 100000; ++i) { ans+=(((sum[min(100000LL,i*b)]-sum[min(100000LL,i*a-1)]+mod)%mod)*dp2[m][i])%mod; ans %= mod; } cout << ans << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout<