A group of 12 people will be partitioned into 3 indistinguishable 4-person committees. Each committee will have one chairperson and one treasurer. The number of different ways to make these assignments can be written as $2^{r}M$, where $r$ and $M$ are positive integers and $M$ is not divisible by 2. What is $r$?