Find the number of ways of arranging the numbers 1, 2, 3, ..., 11, 12 in a array (with three rows and four columns), so that the

Find the number of ways of arranging the numbers 1, 2, 3, ..., 11, 12     in a  array (with three rows and four columns), so that the sum of the numbers in each column is divisible by 3. Each number must appear exactly once in the array.

Thanks!