Maximum 0-1 Distance Problem Statement

Given a binary matrix of size N*M, find the maximum distance 'di' for every 0-cell to its nearest 1-cell, where the distance is measured using Manhattan distance. The task is to determine the maximum of these minimum distances for all 0-cells in the matrix.

Explanation:

For each 0-cell (a cell with value 0) in the matrix, calculate the Manhattan distance to its closest 1-cell (a cell with value 1). The goal is to find the largest of these distances.

Distance Calculation:

The distance between cells (i, j) and (a, b) is expressed as |i-a| + |j-b|, using the Manhattan distance.

Input:

The first line contains an integer 'T' indicating the number of test cases. Each test case consists of: First line: Two integers, N and M, separated by a space (number of rows and columns, respectively). Next N lines: Each line contains M integers (0 or 1) separated by spaces representing the matrix.

Output:

For each test case, output a single integer representing the maximum possible distance from a 0-cell to its nearest 1-cell. Print each result on a new line.

Example:

Input
T = 1
N, M = 2, 2
Matrix = [[0, 1], [0, 1]]

Output
1

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ N ≤ 100
• 1 ≤ M ≤ 100

Note:

You don't need to print anything. Just implement the function according to the provided structure.