{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cpre\u003e\u003cfont face\u003d\"Courier New, Courier, mono\"\u003e\nTime Limit: 3000 MS + 3000 MS Memory Limit: 65536 K \n\n\n \u003chr\u003e\n\n\u003ch2\u003eDescription\u003c/h2\u003e\n\nHave you ever watched the movie Matrix ? \nIn that movie, \nthe term Matrix does not mean a mathematical thing, \nbut a complicated AI system. \n\nIn this problem, \nwe will go back to the original meaning of matrix. \nGiven a 0-1 matrix, \nyou are required to find the maximum submatrix in it \nwhich contains only 0s.\n\n\u003ch2\u003eInput\u003c/h2\u003e\n\nThe first line of input is the number of test case.\nFor each test case:\nThe first line contains two integers N and M.\nThe next N lines each contains M integers, Aij.\nThere is a blank line before each test case.\n\n1 \u0026lt;\u003d N,M \u0026lt;\u003d 1000\n0 \u0026lt;\u003d Aij \u0026lt;\u003d 1\n\n\u003ch2\u003eOutput\u003c/h2\u003e\n\nFor each test case output the answer on a single line.\n\n\u003ch2\u003eSample Input\u003c/h2\u003e\n\n2\n\n2 2\n0 0\n0 0\n\n4 5\n1 0 1 0 0\n0 1 0 0 0\n0 0 1 0 0\n1 1 0 0 0\n\n\u003ch2\u003eSample Output\u003c/h2\u003e\n\n4\n8\n\n\u003ch2\u003eSource\u003c/h2\u003e\n\n8th SCUPC\n\n\u003ch2\u003eAuthor\u003c/h2\u003e\n\nThis problem is in memory of \u003ca href\u003d\"//202.115.53.252:8080/soj/problem.action?id\u003d2096\"\u003eSOJ2096--Maximum Submatrix\u003c/a\u003e.\n\nwindy7926778\n\n\u003c/font\u003e\n\u003c/pre\u003e"}}]}