Geeks's Garden
Easy Accuracy: 64.95% Submissions: 860 Points: 2

Geek has a rosarium and it has N*M slots, some of them are empty and some of them have roses. Given N*M character array consists of 0's and 1's. 0 represents an empty spot and 1 represents a rose. The task is to find the maximum number of adjacent roses in geek's rosarium. For a spot (i, j) adjacent spots are (i+1, j), (i-1, j), (i, j-1), (i, j+1), (i-1, j-1), (i-1, j+1), (i+1, j-1),  and (i+1, j+1).

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two space-separated integers N and M.

3. Next N lines consist of M characters.

Output: For each test case, print the maximum number of adjacent roses.

Constraints:
1. 1 <= T <= 100

2. 1 <= N, M <= 100
3. '0' <= arr[i][j] <= '1'


Example:
Input:

2
2 2
10
01

3 4
1001
0011
0101

Output:
2
5

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Geeks's Garden

Output Window