Given a **N x N** matrix where every cell has some number of coins. Count number of ways to reach bottom right cell of matrix from top left cell with exactly **K** coins. We can move to (i+1, j) or (i, j+1) from a cell (i, j).

**Input:**

First line contains number of test cases T. For each test case, first line contains the integer value '**X**' denoting coins, second line contains an integer 'N' denoting the order of square matrix. Last line contains N x N elements in a single line in row-major order.

**Output:**

Output the number of paths possible.

**Constraints:**

1 <=T<= 500

1 <= K <= 200

1 <= N <= 200

1 <= A_{i} <= 200

**Example:
Input:**

2

16

3

1 2 3 4 6 5 9 8 7

12

3

1 2 3 4 6 5 3 2 1

**Output:**

0

2

**Explanation:**

**Testcase 2:** There are 2 possible paths with exactly K coins, which are (1 + 4 + 3 + 2 + 1) and (1 + 2 + 3 + 5 + 1).

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

UrGuru | 85 |

prernaus24 | 83 |

Vagesh Verma | 82 |

devendrachoudhary5485 | 74 |

highway_to_hell | 72 |

abducodes | 601 |

harshtyagi36 | 295 |

highway_to_hell | 252 |

rajeswarii | 248 |

arpit_anshuman | 240 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.