Contest Venue Setup

Before a regional programming contest opens, the site officials and the volunteers are very busy. One of their jobs is arranging the tables in the hall so that two adjacent tables never seat teams from the same school.

Doing that by hand is tedious, so a program usually does it. This year the judges took the job over. Once the arrangement was done, the judges decided the seating problem was worth using as a contest problem, so here is part of it.

The judges' program is simple. It first assigns the seats arbitrarily. Then it checks whether any two adjacent seats hold teams from the same school. If such seats exist, it counts how many schools gain from the arrangement, that is, how many schools have two of their own teams in adjacent seats.

The hall is a table with $N$ rows and $M$ columns. Each cell seats one team or nobody. A team has at most 8 adjacent teams. A seat on the border of the table, or a seat with empty cells around it, has fewer than 8 adjacent teams.

For example, in the arrangement below a dot is an empty seat.

A B C
D E F
G H .

Team E is adjacent to A, B, C, D, F, G, H, so it has 7 adjacent teams. Team A is adjacent to B, D, E, so it has 3.

The first line contains the number of test cases $T$. ($1 \le T \le 100$)

The first line of each test case contains the number of rows $N$ and the number of columns $M$ of the hall. ($1 \le N, M \le 100$)

Each of the next $N$ lines contains $M$ integers. The $j$-th number on the $i$-th line is the school number of the team seated in row $i$, column $j$, and it is between 1 and 100. If the number is $-1$, that seat is empty.

For each test case, print on one line how many schools have two of their own teams in adjacent seats.