Amy has to visit towns B and C in any order

Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram. How many different routes can she take starting from A and returning to A, going through both B and C (but not more than once through each) and not travelling any road twice on the same trip?

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #115