Ringroad houses

Neha lives in a city that has $n$ houses built along the main ring road. The ring roadhouses are numbered 1 through $n$ in the clockwise order. The ring road traffic is one way and also is clockwise. Neha has recently moved into the ring roadhouse number 1. She has to traverse the $m$ number of houses in the given input sequence $a_1$,$a_2$, ...,$a_m$ (1 ≤ $a_i$ ≤ n). Find the minimum time she