Y by
Given
x
square board has the row and column numbered from
to
, square in
row and
column get symbolized by square
. Subset
of squares on the board is called "good" subset if two random squares
belong to
satisfy that the squares
with
or
are not belong to
. Find the minimum number of "good" distinct subsets such that each square on the board belongs to only one subset













