BITMAP  Bitmap
There is given a rectangular bitmap of size n*m. Each pixel of the bitmap is either white or black, but at least one is white. The pixel in ith line and jth column is called the pixel (i,j). The distance between two pixels p_{1}=(i_{1},j_{1}) and p_{2}=(i_{2},j_{2}) is defined as:
Task
Write a program which:
 reads the description of the bitmap from the standard input,
 for each pixel, computes the distance to the nearest white pixel,
 writes the results to the standard output.
Input
The number of test cases t is in the first line of input, then t test cases follow separated by an empty line. In the first line of each test case there is a pair of integer numbers n, m separated by a single space, 1<=n <=182, 1<=m<=182. In each of the following n lines of the test case exactly one zeroone word of length m, the description of one line of the bitmap, is written. On the jth position in the line (i+1), 1 <= i <= n, 1 <= j <= m, is '1' if, and only if the pixel (i,j) is white.
Output
In the ith line for each test case, 1<=i<=n, there should be written m integers f(i,1),...,f(i,m) separated by single spaces, where f(i,j) is the distance from the pixel (i,j) to the nearest white pixel.
Example
Sample input: 1 3 4 0001 0011 0110 Sample output: 3 2 1 0 2 1 0 0 1 0 0 1
Added by:  Piotr £owiec 
Date:  20040913 
Time limit:  4s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: SCM chicken 
Resource:  6th Polish Olympiad in Informatics, stage 2 
hide comments
Abhay:
20150404 20:15:23
Can anyone help me with some test cases? I've tried many test cases but I am getting WA. 

soshika:
20150401 00:41:06
multisource bfs :)) 

Rachit:
20150315 12:44:42
" but at least one is white "


David:
20150303 00:53:34
What if there are no white pixels in the bitmap, what should I print? 

scyther:
20150127 13:10:35
you just need one word to understand the ques: minesweeper Last edit: 20150127 13:12:46 

the_imp:
20150124 17:48:08
getting sigxfsz runtime error .....somebody plz help


Arafat dad Khan:
20150122 17:54:01
A brilliant problem with a brilliant solution Absolutely loved it 

Rajat (1307086):
20150122 13:42:27
Exactly @ Master_Card 

Francky:
20150102 14:14:34
Is anybody have old Pyramid best timings ? I don't remember my own best time. I think there were several near 0.01s too with Pyramid. 

Kishlay Raj:
20150102 09:55:26
hw can one solve this in 0.0 , _/\_ 