// use std::ops::{Index, IndexMut};
// use std::cmp::{Ordering, min, max};
// use std::collections::{BinaryHeap, BTreeMap};
// use std::collections::btree_map::Entry::{Occupied, Vacant};
// use std::clone::Clone;

fn getline() -> String{
    let mut res = String::new();
    std::io::stdin().read_line(&mut res).ok();
    res
}

macro_rules! split {
    ($x: expr) => {
        ($x).trim().split(' ').collect()
    }
}

macro_rules! parse {
    ($x: expr) => {
        ($x).parse().unwrap()
    }
}

macro_rules! readl {
    ($t: ty) => {
        {
            let s = getline();
            let iv: Vec<_> = split!(s);
            let mut iter = iv.into_iter();
            iter.next().unwrap().parse::<$t>().unwrap()
        }
    };
    ($( $t: ty),+ ) => {
        {
            let s = getline();
            let iv: Vec<_> = split!(s);
            let mut iter = iv.into_iter();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*) 
        }
    };
}

macro_rules! rvec {
    ($x: expr) => {
        ($x).into_iter().map(|x| parse!(x)).collect()
    }
}

macro_rules! readlvec {
    ($t: ty) => {
        {
            let s = getline();
            let iv: Vec<_> = split!(s);
            iv.into_iter().map(|x| x.parse().unwrap()).collect::<Vec<$t>>()
        }
    }
}

macro_rules! debug {
    ($x: expr) => {
        println!("{}: {}", stringify!($x), $x)
    }
}

fn printvec<T>(v: &Vec<T>) where T: std::fmt::Display {
    for (i,e) in v.into_iter().enumerate() {
        if i != 0 {
            print!(" ");
        }
        print!("{}", e);
    }
    println!("");
}

fn gcd(x: u64, y: u64) -> u64{
    if x == 0 {
        y
    } else {
        gcd(y%x, x)
    }
}

fn main() {
    let (n,l,h) = readl!(usize, u64, u64);
    let c = readlvec!(u64);
    const INF: u64 = 1e15 as u64;
    let mut memo0 = vec![INF; 1<<n];
    let mut memo1 = vec![INF; 1<<n];
    fn rec(memo: &mut Vec<u64>, mask: usize, n: usize, c: &Vec<u64>, x: u64) -> u64 {
        if memo[mask] != INF {
            return memo[mask];
        }
        let mut cnt = 0;
        let mut mul = 1;
        for i in 0..n {
            if (mask>>i)&1 == 1 {
                mul = mul*c[i]/gcd(mul, c[i]);
            } else {
                cnt += 1;
            }
        }
        memo[mask] = x/mul;
        for a in mask+1..1<<n {
            if a == mask|a {
                memo[mask] -= rec(memo, a, n, c, x);
            }
        }
        memo[mask]
    }
    let mut ans = 0;
    for i in 0..n {
        ans += rec(&mut memo0, 1<<i, n, &c, h) - rec(&mut memo1, 1<<i, n, &c, l-1);
    }
    println!("{}", ans);
}