prove that in a simple connected graph if every vertex has a degree at least m, then there is a path of length at least m

any hints? i made a path: v0 with deg=1, v1 with deg=2,...vm with deg=m. then said this path has a length of at least m and a degree of at least m.

i'm not sure if that is right?