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

Let's think step by step and output the final answer within \boxed{}.
user