Problem2025--Two Arithmetic Progressions

2025: Two Arithmetic Progressions

[Creator : ]
Time Limit : 2.000 sec  Memory Limit : 256 MiB

Description

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given two arithmetic progressions: a1k+b1 and a2l+b2. Find the number of integers x such that LxR and x=a1k'+b1=a2l'+b2, for some integers k',l'≥0.

Input

The only line contains six integers a1,b1,a2,b2,L,R (0<a1,a2≤2·109,-2·109b1,b2,L,R≤2·109,LR).

Output

Print the desired number of integers x.

Examples
Input
2 0 3 3 5 21
Output
3
Input
2 4 3 0 6 17
Output
2

Source/Category