You are given a parallel table of size n×m. This table comprises of images 0 and 1. You can make such activity: select 3 distinct cells that have a place with one 2×2 square and change the images in these cells (change 0 to 1 and 1 to 0). Your assignment is to make all images in the table equivalent to 0. You are permitted to make
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
You are given a parallel table of size n×m. This table comprises of images 0 and 1.
You can make such activity: select 3 distinct cells that have a place with one 2×2 square and change the images in these cells (change 0 to 1 and 1 to 0).
Your assignment is to make all images in the table equivalent to 0. You are permitted to make all things considered 3nm activities. You don't have to limit the number of activities.
It tends to be demonstrated that it is consistently conceivable.
Input
The principal line contains a solitary integer t (1≤t≤5000) — the number of experiments. The following lines contain portrayals of experiments.
The principal line of the depiction of each experiment contains two integers n, m (2≤n,m≤100).
Every one of the following n lines contains a parallel line of length m, depicting the images of the following column of the table.
It is ensured that the amount of nm for all experiments doesn't surpass 20000.
Output
For each experiment print the integer k (0≤k≤3nm) — the number of activities.
In the every one of the following k lines print 6 integers x1,y1,x2,y2,x3,y3 (1≤x1,x2,x3≤n,1≤y1,y2,y3≤m) portraying the following activity. This activity will be made with three cells (x1,y1), (x2,y2), (x3,y3). These three cells ought to appear as something else. These three cells ought to have a place into some 2×2 square
Step by step
Solved in 4 steps with 1 images
