Identities and Techniques, Proved · Superchallenge problem

How many strings of twelve $0$s and $1$s contain exactly three maximal blocks of consecutive $1$s, each block of length at least $2$? (For example, $110011100110$ is one of them.)