#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <list>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(d) string(1,d)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

vector<ll> v;

ll gcd(ll a, ll b) {
  return b == 0 ? a : gcd(b, a % b);
}

ll f(ll a) {
  ll ret = 0;
  ll n = (ll)v.sz;
  rep(i, 0, (1 << n)) {
    ll d = 1;
    rep(j, 0, n) {
      if ((i >> j) & 1) {
        ll e = d * v[j];
        ll g = gcd(d, v[j]);
        d = e / g;
      }
      if (d > a) {
        d = 0;
        break;
      }
    }
    if (d == 0)continue;
    ll c = 0;
    ll h = a / d;
    rep(j, 0, n) {
      if ((i >> j) & 1) {
        c++;
      }
    }
    if (c % 2 == 1) {
      ret += h * c;
    }
    else {
      ret -= h * c;
    }
  }
  return ret;
}

int main() {
  ll n, l, h;
  cin >> n >> l >> h;
  rep(i, 0, n) {
    ll c;
    cin >> c;
    v.pb(c);
  }
  printf("%lld\n", f(h) - f(l - 1));
  return 0;
}