Determine the row index with minimum number of ones. The given 2D matrix has only zeroes and ones and also the matrix is sorted row wise. If two or more rows have same number of **1's** than print the row with **smallest index**.

**Input:**

The first line of input contains an integer **T **denoting the number of test cases. The first line of each test case consists of two integer **n** and **m**. The next line consists of **n*m** spaced integers.

**Output:**

Print the index of the row with minimum number of 1's. If there is 0 number of '1' in the matrix then, print '**-1**'.

**Constraints: **

1 <= T <= 103

1 <= n, m <= 100

**Example:
Input:**

2

3 3

0 0 0 0 0 0 0 0 0

4 4

0 0 0 1 0 1 1 1 0 0 1 1 0 0 1 1

**Output:**

-1

0

**Explanation:
Testcase **

0 0 0 1

0 1 1 1

0 0 1 1

0 0 1 1

First row is having minimum number of 1 i.e. answer is 0.

Author: saksham0751

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.

mantan_g | 267 |

tushki | 198 |

aksht7 | 182 |

ayush1101 | 128 |

namansharmacse17 | 110 |

ARUN_PUNDIR | 730 |

manishgupta8497 | 627 |

AMAN__JAIN | 625 |

Abhimanyu_kumar | 562 |

AJ786 | 541 |

blackshadows | 5335 |

Ibrahim Nash | 5223 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4584 |

Login to report an issue on this page.