You are playing a 2D Jenga game represented by a grid with (n) rows and (m) columns. The (1)-st row is the top level of the tower, and the (n)-th row is the bottom level. Each piece at row (i) and column (j) has a destabilization factor (a_{i,j}). Additionally, each row (i) has an initial stability index of (v_i). When you remove a piece, it is completely discarded from the game. Removing a piece from row (i) damages all levels at and above it. Specifically, for every row (k) such that (1 \le k \le i), its stability index is decreased by (a_{i,j}). The tower collapses if either of the following conditions is met: The stability index of any level drops to (0) or less. Any level is left with exactly (0) pieces (even if it is the topmost level). Find the minimum number of pieces you must remove such that the tower collapses. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains two integers (n) and (m) ((1 \le n, m \le 10^6)) — the number of rows and columns of the tower. The second line contains (n) integers (v_1, v_2, \ldots, v_n) ((1 \le v_i \le 10^9)) — the initial stability indices of each level from top to bottom. Each of the next (n) lines contains (m) integers. The (j)-th integer on the (i)-th line is (a_{i, j}) ((1 \le a_{i, j} \le 10^9)) — the destabilization factor of the piece at row (i) and column (j). It is guaranteed that the sum of (n \cdot m) over all test cases does not exceed (10^6). For each test case, output a single integer — the minimum number of pieces that must be removed to collapse the tower. In the first testcase, we have a (2 \times 3) tower. The initial stabilities are (v_1 = 10) and (v_2 = 20). The top level ((i=1)) has pieces with destabil