Bipartite Graphs and Matchings · Superchallenge problem

Six committees $1,\dots,6$ each need a representative from among six people $1,\dots,6$: committee $i$ may choose any of the three people $i, i+1, i+2$ (numbers taken mod $6$, using $1$–$6$). In how many ways can all six committees be given DIFFERENT representatives?