#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;

ll gcd(ll x, ll y) {
    if(y == 0) {
        return x;
    }
    return gcd(y, x % y);
}

ll lcm(ll x, ll y) {
    return x / gcd(x, y) * y;
}

ll LCM(vl &v) {  // vの全要素のlcm
    ll res = 1;
    rep(i, v.size()) {
        res = lcm(res, v[i]);
    }
    return res;
}

int main() {
    ll n, a, b;
    cin >> n >> a >> b;

    vl c(n);
    rep(i, n) {
        cin >> c[i];
    }

    ll ans = 0;
    exrep(S, 1, (1<<n) - 1) {
        vl vec;
        rep(i, n) { 
            if(S & 1<<i) {
                vec.pb(c[i]);   
            }
        }
        ll x = LCM(vec);
        ll f = b / x - (a - 1) / x;
        ll y = __builtin_popcount(S);
        if(y % 2 == 1) {
            ans = (ans + y * f % mod) % mod;
        }
        else {
            ans = (ans + mod - y * f % mod) % mod;
        }
    }

    out(ans);
    re0;
}