#include #define rep(i, n) for(int i = 0; i < (int)(n); i++) using namespace std; typedef long long ll; int INF = (1LL << 30) - 1; int MOD = 1e9+7; ll gcd (ll a,ll b){ return b ? gcd(b,a%b) : a; } ll lcm(vector V){ ll l = V[0]; for(auto i:V){ l = l / gcd(l,i) * i; } return l; } main(){ ll N,L,H; cin >> N >> L >> H; vector C(N); rep(i,N)cin >> C[i]; ll ans = 0; rep(i,1 << N){ if(!i)continue; int bit = __builtin_popcountll(i); vector V; rep(j,N){ if(i & (1 << j)){ V.push_back(C[j]); } } auto l = lcm(V); ll cnt = H / l - (L-1) / l; //cout << cnt << endl; ans += (bit&1 ? cnt * bit : -cnt * bit); } cout << ans << endl; }