// Original C++ solution (slower):
//A,Elebereth Gilthoniel mantae!

//For Temeria!

#include<iostream>

#include<algorithm>

#include<cmath>

#include<string>

#include<vector>

#include<set>

#include<cstdio>

#include<map>

#include<stack>

#include<queue>

#include<cstring> 

using namespace std;

long long ss[300008],kl[300008];

long long oss,okl,ox;

long long l[300008],r[300008];

int main()

{

 	//freopen("","r",stdin);

	//freopen("","w",stdout);

	long long n,m;

	cin>>n>>m;

	cin>>r[0];

	for(long long i=0;i<n-1;i++)

	{

		l[i+1]=r[i];scanf("%d",&r[i+1]);

		long long a=l[i+1],b=r[i+1];

		if(a>b) b+=m;

		oss+=b-a;

		ss[a+1]+=a+1;

		kl[a+1]++;

		ss[b+1]-=a+1;

		kl[b+1]--;

	}

	for(long long i=1;i<=2*m;i++)

	{

		ss[i]+=ss[i-1];kl[i]+=kl[i-1];

		//cout<<i<<":"<<ss[i]<<" "<<kl[i]<<endl;

	}

	long long ans=1234651324789;

	for(long long i=1;i<=m;i++)

	{

		long long ft=oss;

		ft+=ss[i];

		ft-=kl[i]*i;

		ft+=ss[i+m];

		ft-=kl[i+m]*(i+m);

		ans=min(ans,ft);//cout<<ft<<ans<<" ";

	}

	cout<<ans<<endl;

	return 0;

}

/*

4 6

1 5 1 4

*/

// Optimized solution to the same problem (faster):
#include<cstdio>

#include<algorithm>

using namespace std;

#define ll long long

const int maxn=1e5+5;

const ll INF=0x3f3f3f3f3f3f3f3f;

int a[maxn];

struct node

{

    int l,r;

    ll diff,lz;

}tree[4*maxn];

void build(int l,int r,int cur)

{

    tree[cur].l=l;

    tree[cur].r=r;

    if(l==r)

        return;

    int mid=(l+r)>>1;

    build(l,mid,cur<<1);

    build(mid+1,r,cur<<1|1);

    return;

}

void push_up(int cur)

{

    tree[cur].diff=tree[cur<<1].diff+tree[cur<<1|1].diff;

    return;

}

void push_down(int cur)

{

    if(tree[cur].lz!=0)

    {

        tree[cur<<1].diff+=(tree[cur<<1].r-tree[cur<<1].l+1)*tree[cur].lz;

        tree[cur<<1].lz+=tree[cur].lz;

        tree[cur<<1|1].diff+=(tree[cur<<1|1].r-tree[cur<<1|1].l+1)*tree[cur].lz;

        tree[cur<<1|1].lz+=tree[cur].lz;

        tree[cur].lz=0;

    }

    return;

}

void add(int l,int r,ll val,int cur)

{

    if(l>r) return;

    if(tree[cur].l>=l&&tree[cur].r<=r)

    {

        tree[cur].diff+=(tree[cur].r-tree[cur].l+1)*val;

        tree[cur].lz+=val;

        return;

    }

    if(tree[cur].l>r||tree[cur].r<l)

        return;

    push_down(cur);

    add(l,r,val,cur<<1);

    add(l,r,val,cur<<1|1);

    push_up(cur);

    return;

}

ll diff0[maxn];

void together(int cur)

{

    if(tree[cur].l==tree[cur].r)

    {

        diff0[tree[cur].l]=tree[cur].diff;

        return;

    }

    push_down(cur);

    together(cur<<1);

    together(cur<<1|1);

    push_up(cur);

    return;

}

ll minn[maxn];

int main()

{

    int n,m;

    scanf("%d%d",&n,&m);

    for(int i=1;i<=n;i++)

        scanf("%d",&a[i]);

    build(0,m-1,1);

    ll base=0;

    for(int i=1;i<n;i++)

    {

        if(a[i]<a[i+1])

        {

            base+=(ll)(a[i+1]-a[i]);

            add(a[i]+1,a[i+1]-1,-1,1);

            add(a[i+1],a[i+1],a[i+1]-a[i]-1,1);

        }

        else

        {

            base+=(ll)(m-a[i]+a[i+1]);

            add(0,0,-(m-a[i]),1);

            add(1,a[i+1]-1,-1,1);

            add(a[i+1],a[i+1],m-a[i]+a[i+1]-1,1);

            add(a[i]+1,m-1,-1,1);

        }

    }

    together(1);

    minn[0]=base;

    for(int i=1;i<=m;i++)

        minn[i]=minn[i-1]+diff0[i-1];

    ll ans=INF;

    for(int i=1;i<=m;i++)

        ans=min(ans,minn[i]);

    printf("%lld\n",ans);

    return 0;

}

/*

 4 6

 1 5 1 4

 8 9 7 5 6 9

 

 9 9 8 7 6 5 4 3 2

 */


// Fastest known solution for this problem: