Two Arithmetic Progressions

1000ms

262144K

Description:

You are given two arithmetic progressions: a₁k + b₁ and a₂l + b₂. Find the number of integers x such that L ≤ x ≤ R and x = a₁k' + b₁ = a₂l' + b₂, for some integers k', l' ≥ 0.

Input:

The only line contains six integers a₁, b₁, a₂, b₂, L, R (0 < a₁, a₂ ≤ 2·10⁹, - 2·10⁹ ≤ b₁, b₂, L, R ≤ 2·10⁹, L ≤ R).

Output:

Print the desired number of integers x.

Sample Input:

2 0 3 3 5 21

Sample Output:

Sample Input:

2 4 3 0 6 17

Sample Output:

Informação

Provedor Codeforces

Código CF710D