HMMT 2017 T6

Let $r$ be a positive integer. Show that if a graph $G$ has no cycles of length at most $2 r$, then it has at most $|V|^{2016}$ cycles of length exactly $2016 r$, where $|V|$ denotes the number of vertices in the graph $G$.