Go Round

In a Circular City, there are $n$ houses, numbered from 1 to n and arranged in 1,2,...,n,1,2,... Chef needs to deliver packages to $m$ (m<=n) houses. Chef is initially at house 1. Chef decides an integer $x$ and stops after every $x$ houses. i.e- if $n=7$ and $x=2$. He will stop at 1,3,5,7,2,... He may deliver a package when he stops at a house. His work is done when all the packages are deliver