New update is available. Click here to update.

Posted: 28 Nov, 2020

Difficulty: Hard

```
Since the answer can be very large print the answer modulo 10 ^ 9 + 7.
```

```
Given:
‘N’ = 3, ‘M’ = 3
‘Grid[][]’ = [[5, 2, 5],
[3, 3, 1],
[3, 5, 1]]
‘K’ = 14.
The answer will be 1, since There is only 1 path that is from (0,0) to (0,1) to (0,2) to (1,2) to (2,2) this is because 5 + 2 + 5 + 1 + 1 = 14
```

```
The first line of input contains an integer ‘T’ denoting the number of test cases.
The first line of each test case contains two space-separated integers, ‘M,’ where ‘M’ is the number of rows in ‘SEATS’ and ‘N’ where ‘N’ is the number of columns in ‘GRID’.
The next ‘M’ lines of each test case contains ‘N’ space-separated integers, which denotes the number of coins at each point.
The next line of each test case contains a single integer ‘K’.
```

```
For each test case, You are supposed to return an integer that denotes the total number of paths with the sum of coins equal to ‘K’.
```

```
You are not required to print the expected output; it has already been taken care of. Just implement the function.
```

```
1 <= ‘T’ <= 10
1 <= ‘N’ <= 20
1 <= ‘M’ <= 20
0 <= ‘K’ <= 1000
Time Limit: 1sec.
```

Popular Interview Problems: