Problem: Iahub and his friend Floyd have started painting a wall. Iahub is painting the wall red and Floyd is painting it pink. You can consider the wall being made of a very large number of bricks, numbered 1, 2, 3 and so on. 

Iahub has the following scheme of painting: he skips x - 1 consecutive bricks, then he paints the x-th one. That is, he'll paint bricks x, 2·x, 3·x and so on red. Similarly, Floyd skips y - 1 consecutive bricks, then he paints the y-th one. Hence he'll paint bricks y, 2·y, 3·y and so on pink.

After painting the wall all day, the boys observed that some bricks are painted both red and pink. Iahub has a lucky number a and Floyd has a lucky number b. Boys wonder how many bricks numbered no less than a and no greater than b are painted both red and pink. This is exactly your task: compute and print the answer to the question. 

Input

The input will have a single line containing four integers in this order: x, y, a, b. (1 ≤ x, y ≤ 1000, 1 ≤ a, b ≤ 2·109, a ≤ b).

Output

Output a single integer — the number of bricks numbered no less than a and no greater than b that are painted both red and pink.

Examples

Input

2 3 6 18


Output

3

Note

Let's look at the bricks from a to b (a = 6, b = 18). The bricks colored in red are numbered 6, 8, 10, 12, 14, 16, 18. The bricks colored in pink are numbered 6, 9, 12, 15, 18. The bricks colored in both red and pink are numbered with 6, 12 and 18. 

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class TheWall340A {

    public static void main(String[] args) {

        @SuppressWarnings("resource")
        Scanner sc = new Scanner(System.in);
        long a, b, x, y;
        x = sc.nextLong();
        y = sc.nextLong();
        a = sc.nextLong();
        b = sc.nextLong();

        long lcm = findLCM(x, y);
        System.out.println(findNoOfTerms(a, b, lcm));
    }

    private static long findNoOfTerms(long x, long y, long lcm) {
        long mod = x % lcm;
        long start = x;
        if(mod != 0)
            start += (lcm - mod);
        mod = y % lcm;
        long end = y;
        if(mod != 0)
            end -= mod;
        if(end >= start)
            return((end-start) / lcm) + 1;
        return 0;
    }

    private static long findLCM(long x, long y) {
        long gcd = findGCD(x, y);
        return (x * y) / gcd;
    }

    private static long findGCD(long x, long y) {
        if (y == 0)
            return x;
        else
            return findGCD(y, x % y);
    }

}