Geek is a software developer working on an algorithm that processes an integer array arr$[]$ of length n the values in arr represent data points and each data points falls within range of $0$ to M$-1$ Geek's task is to modify array arr in the minimum number of operations to ensure that the data points are in non decreasing order in one operation Geek can increase the value of data point arr$[$i$]$by $1$ taking modulo M of Result so the goal is to find minimum number of operations required to make array arr non decreasing

Example $1$

n$=4$

m$=5$

arr$=\{4,1,3,2\}$

OUTPUT

$2$

EXAMPLE $2$

Input

n$=5$

m$=10$

arr$=\{0,0,1,3,7\}$

output

$0$

from typing import List

Class Solution:

def minOperations$($self$,$n:int,m:int,arr:List$[$int$])->$int:

#write code here