Anurag has a permutation of integers in range $[1, N]$ denoted by A. A permutation is a sequence of all integers in given range and all integers in sequence are distinct, ie, each integer in range occurs exactly once.

Now, he asks Q queries, each one denoted by 2 intgers L and R. For each query, you must find the number of pairs of indices i and j, such that--

• $A_i$ divides $A_j$

• $L \leq i, j \leq R$

Input Format:

First line contains N and Q, length of sequence and number of queries respectively.

Second line contains N integers denoting the sequence.

Each of the next Q lines contains L and R denoting the query.

Output Format:

For each query, output the required answer in separate lines.

Constraints:

$1 \leq N, Q \leq 10^5$

$1 \leq A_i \leq N$

$1 \leq L \leq R \leq N$