Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Thanos just finished his relief work.

We all know that Thanos loves balanced things. So he finds something to be balanced in his relief work. He wants to know how many **Balanced Relief Pair** are possible in the relief work.
The **Balanced Relief Pair** is a pair where one is male and another one is female, And the summation of their relief unit is in the range **L** to **R** inclusive.**For example:** suppose there are 3 males and 2 females. Relief units of males and females are **{1, 2, 3}** and **{4, 5}** Respectively, And the range is**{7, 9}** . For this example the **Balanced Relief Pair**s are **{3, 4}** , **{2, 5}** and **{3, 5}**, So the answer for this example is **3**.

Input starts with two integers **N** and **M** denoting the numbers of males and females people.
The second line contains **N** integers **A _{i}** of them is the relief units for

**Constraints:****1 ≤ N, M ≤ 10 ^{6}**

Print a single integer denoting the number of **Balanced relief pair**.

Input | Output |
---|---|

3 3 6 1 6 5 3 2 8 16 | 6 |

56% Solution Ratio

Gias_UddinEarliest,

gurbuzFastest, 0.2s

saurav_paulLightest, 8.0 MB

jaberndcShortest, 371B

Login to submit