#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

template<class T> class segtree {
	using F1 = function<T(T, T)>;
	using F2 = function<void(T&, T)>;
	using F3 = function<bool(T, T)>;
	T unit;
	F1 f1;
	F2 f2;
	F3 f3; bool s3 = false;

	int n, real_n;
	vector<T> dat;
	vector<pair<int, int>> range;
public:
	segtree() {}
	segtree(const int& _n, const F1& _f1, const F2& _f2, const T _unit)
		: real_n(_n), f1(_f1), f2(_f2), unit(_unit) {
		init1();
	}
	segtree(const int& _n, const F1& _f1, const F2& _f2, const F3& _f3, const T _unit)
		: real_n(_n), f1(_f1), f2(_f2), f3(_f3), unit(_unit), s3(true) {
		init1(), init2();
	}
	segtree(const vector<T>& _dat, const F1& _f1, const F2& _f2, const T _unit)
		: real_n(_dat.size()), f1(_f1), f2(_f2), unit(_unit) {
		init1();
		FOR(i, 0, real_n)dat[i + n] = _dat[i];
		init2(true);
	}
	segtree(const vector<T>& _dat, const F1& _f1, const F2& _f2, const F3& _f3, const T _unit)
		: real_n(_dat.size()), f1(_f1), f2(_f2), f3(_f3), unit(_unit), s3(true) {
		init1();
		FOR(i, 0, real_n)dat[i + n] = _dat[i];
		init2(true);
	}
	inline void init1() {
		n = 1;
		while (n < real_n)n <<= 1;
		dat.assign(n << 1, unit);
		if (s3)range.assign(n << 1, { 0,0 });
	}
	inline void init2(bool with_array = false) {
		if (s3)FOR(i, 0, n)range[n + i] = make_pair(i, i + 1);
		rFOR(i, 1, n) {
			if (with_array)dat[i] = f1(dat[i << 1], dat[i << 1 | 1]);
			if (s3)range[i] = make_pair(range[i << 1].first, range[i << 1 | 1].second);
		}
	}
	inline void update(int i, T a) {
		i += n;
		f2(dat[i], a);
		while (1 < i) {
			i >>= 1;
			dat[i] = f1(dat[i << 1], dat[i << 1 | 1]);
		}
	}
	inline T value(int l, int r) {
		T ret = unit;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (l & 1)ret = f1(ret, dat[l++]);
			if (r & 1)ret = f1(ret, dat[--r]);
		}
		return ret;
	}
	inline int binary_search(T a) {
		assert(s3);
		if (!f3(dat[1], a))return real_n;
		int idx = 2;
		T cur = unit;
		for (; idx < n << 1; idx <<= 1) {
			if (!f3(f1(cur, dat[idx]), a)) {
				cur = f1(cur, dat[idx++]);
			}
		}
		return min((idx >> 1) - n, real_n);
	}
	inline int binary_search(int l, int r, T a) {
		assert(s3);
		T cur = unit;
		int ret = l;
		for (int idx = n + l; idx < n << 1 && ret < r;) {
			if (range[idx].second <= r && !f3(f1(cur, dat[idx]), a)) {
				cur = f1(cur, dat[idx]);
				ret = range[idx++].second;
				if (!(idx & 1))idx >>= 1;
			}
			else idx <<= 1;
		}
		return ret;
	}
	inline T operator[](int i) { return dat[i + n]; }
};

namespace std {
	pair<ll, ll> operator+=(pair<ll, ll>& x,  const pair<ll, ll>& y) {
		x.first += y.first;
		x.second += y.second;
		return x;
	}
	pair<ll, ll> operator+(pair<ll, ll> x,  const pair<ll, ll>& y) {
		return x += y;
	}
}

int main() {
    init();
	
    int n, m; cin >> n >> m;
    ll def = 0;
    VI a(n);
    vector<pair<int, int>> lr;
    FOR(i, 0, n) {
		cin >> a[i];
        --a[i];
        if (i == 0)continue;
        if (a[i - 1] < a[i]) {
            def += a[i] - a[i - 1];
            lr.emplace_back(a[i - 1], a[i]);
        }
        else {
            def += a[i] - a[i - 1] + m;
			lr.emplace_back(-m+a[i-1], a[i]);
            lr.emplace_back(a[i - 1], m);
        }
    }
    SORT(lr);

	segtree<pair<ll, ll>> seg(m + 1,
		[](pair<ll, ll> x, pair<ll, ll> y) {return x + y; },
		[](pair<ll, ll>& x, pair<ll, ll> y) {x += y; }, pair<ll, ll>());

    ll ans = def;
    for (int i = 0, idx = 0; i < m; ++i) {
		for (int l, r; idx < lr.size() &&
			(tie(l, r) = lr[idx], l < i); ++idx) {
			seg.update(r, make_pair(l, 1));
		}
		auto [sum, cnt] = seg.value(i, m + 1);
		chmin(ans, def - ll(i) * cnt + sum + cnt);
	}
	print(ans);

    return 0;
}

Measured memory_bytes: 9364