def ascan; gets.split.map(&:to_i); end
def scan; gets.to_i; end

def gcd(a,b)
    0<b ? gcd(b, a % b) : a
end
def lcm(a,b)
    a * b / gcd(a, b)
end

n,l,h = ascan
cc = ascan
l-=1

r = 0
#cc.each{|c|
#    flg = false
#    cc.each{|d|
#        flg |= c%d==0 if c!=d
#    }
#    unless flg
#        r += h/c -l/ c
#    end
#}
cc.each{|c|
    r += h/c -l/ c
}
#p r
2.upto(n){|i|
    cc.combination(i){|v|
        e = v.inject(1){|s,x| lcm(s,x)}
        
        tmp = h/e - l/ e
        #p [v,e,tmp]
        r +=tmp*(i.odd?? i : -i)
    }
}

p r