Circuits through prescribed edges

We prove that a connected graph contains a circuit—a closed walk that repeats no edges—through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$.