- from math import gcd, ceil 
-   
- t = int(input()) 
- while t>0: 
- 	t-=1 
- 	n = int(input()) 
- 	rebel = [int(i) for i in input().split(" ")] 
- 	l, u = [int(i) for i in input().split(" ")] #army l u both inclusive 
-   
- 	lcm = rebel[0] 
- 	for i in rebel[1:]: 
- 	  lcm = lcm*i//gcd(lcm, i) 
-   
- 	m = ceil(l/lcm) 
- 	n = u//lcm 
- 	ans = u-l+1-(n-m+1) 
- 	# print(lcm, n, m, ans) 
- 	print (ans if ans>0 else 0) 
-   
-   
				ZnJvbSBtYXRoIGltcG9ydCBnY2QsIGNlaWwKCnQgPSBpbnQoaW5wdXQoKSkKd2hpbGUgdD4wOgoJdC09MQoJbiA9IGludChpbnB1dCgpKQoJcmViZWwgPSBbaW50KGkpIGZvciBpIGluIGlucHV0KCkuc3BsaXQoIiAiKV0KCWwsIHUgPSBbaW50KGkpIGZvciBpIGluIGlucHV0KCkuc3BsaXQoIiAiKV0gI2FybXkgbCB1IGJvdGggaW5jbHVzaXZlCgkKCWxjbSA9IHJlYmVsWzBdCglmb3IgaSBpbiByZWJlbFsxOl06CgkgIGxjbSA9IGxjbSppLy9nY2QobGNtLCBpKQoKCW0gPSBjZWlsKGwvbGNtKQoJbiA9IHUvL2xjbQoJYW5zID0gdS1sKzEtKG4tbSsxKQoJIyBwcmludChsY20sIG4sIG0sIGFucykKCXByaW50IChhbnMgaWYgYW5zPjAgZWxzZSAwKQoK