992_B. Nastya Studies Informatics
Today on Informatics class Nastya learned about GCD and LCM (see links below). Nastya is very intelligent, so she solved all the tasks momentarily and now suggests you to solve one of them as well.

We define a pair of integers (a, b) good, if GCD(a, b) = x and LCM(a, b) = y, where GCD(a, b) denotes the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) of a and b, and LCM(a, b) denotes the [least common multiple](https://en.wikipedia.org/wiki/Least_common_multiple) of a and b.

You are given two integers x and y. You are to find the number of good pairs of integers (a, b) such that l ≤ a, b ≤ r. Note that pairs (a, b) and (b, a) are considered different if a ≠ b.

Input

The only line contains four integers l, r, x, y (1 ≤ l ≤ r ≤ 109, 1 ≤ x ≤ y ≤ 109).

Output

In the only line print the only integer — the answer for the problem.

Examples

Input

1 2 1 2


Output

2


Input

1 12 1 12


Output

4


Input

50 100 3 30


Output

0

Note

In the first example there are two suitable good pairs of integers (a, b): (1, 2) and (2, 1).

In the second example there are four suitable good pairs of integers (a, b): (1, 12), (12, 1), (3, 4) and (4, 3).

In the third example there are good pairs of integers, for example, (3, 30), but none of them fits the condition l ≤ a, b ≤ r.
```python
from collections import defaultdict

l, r, x, y = map(int, input().split())

if x == y == 1:
    if l == 1:
        print(1)
        exit()

    print(0)
    exit()

if y % x != 0:
    print(0)
    exit()

c = x * y

c_ = y // x
i = 2
del_ = defaultdict(int)
while c_ > 1:
    while c_ % i == 0:
        c_ //= i
        del_[i] += 1

    i += 1

mas = tuple(k ** v for k, v in del_.items())
ln = len(mas)

ans = 0
for i in range(2 ** ln):
    b = bin(i)[2:].zfill(ln)

    a = x
    for j in range(ln):
        if b[j] == '1':
            a *= mas[j]

    b = c // a

    if l <= a <= r and l <= b <= r:
        ans += 1

print(ans)

```