Cycle spectra of Hamiltonian graphs

We prove that every Hamiltonian graph with n vertices and m edges has cycles with more than different lengths, where p=m−n. For general m and n, there exist such graphs having at most different cycle lengths.