How many ways can one fill a $3\times 3$ square grid with nonnegative integers such that no nonzero integer appears more than once in the same row or column and the sum of the numbers in every row and column equals $7$?