Erdős Problem #752 — Many distinct cycle lengths from minimum degree and girth

For every integer $s≥2$, is there a constant $c_s>0$ such that every graph of minimum degree at least $k$ and girth greater than $2s$ contains more than $c_sk^s$ cycles of distinct lengths?