Given positive integers $n$ and $m$, count the number of pairs of positive integers $(a, b)$ that satisfy the following conditions:

1. $1 \leq a \leq n, 1 \leq b \leq m$;
2. $a \times b$ is a multiple of $2016$.

Input

The input contains no more than $30$ test cases.

Each test case contains two integers $n, m$ ($1 \leq n, m \leq 10^9$).

Output

For each test case, output an integer representing the number of pairs that satisfy the conditions.

Examples

Input 1

32 63

Output 1

1

Input 2

2016 2016

Output 2

30576

Input 3

1000000000 1000000000

Output 3

7523146895502644