Given a n x m matrix consisting on only non negative integers and another non negative integer k.
Check if there exists any square submatrix whose sum = k.

Required Time Complexity => (n x m)