Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

## MATRIX - Count maximum matrices

Đọc đề đẹp hơn ở:
https://codeforces.com/group/FLVn1Sc504/contest/274505/problem/E

You are given a matrix A of M rows and N columns, consisting of numbers 0 and 1. For a rectangle in A (sides >= 1), X1 is the number of ones on its sides, X0 is the number of zeros on its sides, and its value is defined as X1 – X0. Let us consider W, the maximum value taken over submatrices of A, and S, the number of submatrices with value W. Your task is to find W and S.

### Input

The first line of input contains the number of testcases t (t <= 15). The first line of each testcase contains the numbers M, N (1 <= M, N <= 200) Then M lines follow. In each line, there are N numbers 0 or 1.

### Output

For each testcase, you should output a single line with numbers W and S.

### Example

```Input:
1
5 6
1 1 1 1 1 1
1 0 0 0 0 1
1 0 0 0 0 1
1 0 0 0 0 1
1 1 1 1 1 1

Output:
18 1
```

 Được gửi lên bởi: Lê Đôn Khuê Ngày: 2005-06-08 Thời gian chạy: 2.538s Giới hạn mã nguồn: 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Ngôn ngữ cho phép: Tất cả ngoại trừ: GOSU NODEJS PERL6 PYPY RUST SED VB.NET