#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
ll n,l,r,a[15];
ll gcd(ll x,ll y){
	if(x<y)swap(x,y);
	if(x%y==0)return y;
	return gcd(y,x%y);
}
ll lca(ll x,ll y){
	return x*y/gcd(x,y);
}
ll sum(ll x){
	ll res=0;
	for(int k=1;k<1<<n;k++){
		ll p=1,c=0;
		bool ok=true;
		for(int i=0;i<n&&ok;i++){
			if(k>>i&1){
				p=lca(p,a[i]);
				if(p>x)ok=false;
				c++;
			}
		}
		if(!ok)continue;
		if(c==1)res+=x/p;
		else if(c%2)res+=(x/p)*c;
		else res-=(x/p)*c;
	}
	return res;
}
int main(void){
    cin>>n>>l>>r;
    for(int i=0;i<n;i++)cin>>a[i];
    cout<<sum(r)-sum(l-1)<<endl;
}