New update is available. Click here to update.

Topics

Let us say you randomly choose 'N' non-negative integers less than 'M' and put them in an array 'A'.

Find the probability that 'A' is sorted in non-decreasing order.

The answer should be found modulo 10^9 + 7. Formally, let M = 10^9 + 7. It can be shown that the answer can be expressed as an irreducible fraction p/q, where p and q are integers and q !≡ 0 (mod M). Output the integer equal to p * (q^-1) mod M. In other words, output such an integer x that 0 <= x < M and x * q ≡ p (mod M).

```
Let 'N' = 3, 'M' = 3.
There are 27 possible final arrays.
10 of them are sorted in non-decreasing order: [ '0, 0, 0' ], [ '1, 1, 1' ], [ '2, 2, 2' ], [ '0, 1, 2' ], [ '0, 0, 1' ], [ '0, 1, 1' ], [ '0, 0, 2' ], [ '0, 2, 2' ], [ '1, 1, 2' ], [ '1, 2, 2' ].
Thus the probability needed is '(10 / 27) % (10^9 + 7) = 703703709'.
```

Detailed explanation

```
1 <= 'T' <= 10
2 <= 'N, M' <= 10^3
Time Limit: 1 sec
```

```
2
3 5
2 2
```

```
960000007
750000006
```

```
First test case:-
There are '5^3 = 125' possible final arrays.
Out of the arrays with 'A[ 0 ] = 0', exactly '15' are sorted in non-decreasing order.
For arrays with 'A[ 0 ] = 1', exactly '10' are sorted in non-decreasing order.
For arrays with 'A[ 0 ] = 2', exactly '6' are sorted in non-decreasing order.
For arrays with 'A[ 0 ] = 3', exactly '3' are sorted in non-decreasing order.
For arrays with 'A[ 0 ] = 4', exactly '1' is sorted in non-decreasing order.
Thus, the answer is '(35 / 125) % (10^9 + 7) = 960000007'.
Second test case:-
There are 4 possible final arrays.
3 of them are sorted in non-decreasing order: [ '0, 0' ], [ '0, 1' ], [ '1, 1' ].
Thus, the answer is '(3 / 4) % (10^9 + 7) = 750000006'.
```

```
2
25 43
60 29
```

```
43816143
973827568
```