3.70 Can integers be written in each cell of an infinitely large grid paper so that in every rectangle consisting of $4 \times 6$ cells and bounded by grid lines, the sum of all numbers is equal to (1) $10, (2) 1$?
［Solution］The filling principle shown in the right figure is: select two sets of diagonal lines in different directions. The first set is to select a line every 4 cells moved, and fill in 1 and 0 alternately on the line; the second set is to select a line every 6 cells moved, and fill in -1 and 0 alternately on the line. It is easy to verify that in each $4 \times 6$ rectangle, there are 3 1s, 2 -1s, and 5 0s, and their sum is 1. The unfilled cells all represent 0.

If all the numbers already filled in the table are changed to 1, and the empty cells still represent 0, then the sum of the 24 numbers in each $4 \times 6$ rectangle is 10.

Of course, there are simpler ways to fill the numbers so that the sum is 10. See the figure below.