# Beaver paths

**Discrete Mathematics**Level 5

Benoît the beaver is sitting on a plane. Every second, Benoît will turn an angle that is some multiple of \(\frac{2\pi}{2003}\) and run forwards 1 unit.

202303 seconds after he started running, Benoît, against all odds, finds that he is in exactly the same place he started.

The number of distinct paths Benoît could have taken can be represented as \(\displaystyle\frac{a!}{b!^c}\), where \(a\), \(b\), and \(c\) are positive integers. What is \(a+b+c\)?