#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 2e5 + 11;

int b[N];
int lb(int x) { return x & (-x); }
void update(int p, int c) {
	for(int i = p; i < N; i += lb(i))
		b[i] += c;
}
int query(int p) {
	int r = 0;
	for(int i = p; i; i -= lb(i))
		r += b[i];
	return r;
}

struct seg {
	int l, r;
	bool operator <(const seg &s) const {
		return r < s.r;
	}
}s[N];

int main() {
	ios :: sync_with_stdio(false);
	
	int n, m; cin >> n >> m;
	for(int i = 0; i < n; i ++) {
		cin >> s[i].l >> s[i].r;
		s[i].r --;
	}
	sort(s, s + n);
	
	ll ans = 1;
	for(int i = 0; i < n; i ++) {
		ll t = query(N - 1) - query(s[i].l - 1);
		
		if(t > m) ans = 0;
		else ans = ans * (m - t) % mod;
		
		update(s[i].r, 1);
	}
	
	ans = (qpow(m, n) - ans + mod) % mod;
	
	cout << ans << '\n';
}