#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using pint = pair<lint, lint>;
using vp = vector<pint>;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
	lint N, K;
	cin >> N >> K;
	vp v(N);
	rep(i, N) cin >> v[i].first >> v[i].second;

	mint a=0, b=0, c=0;
	lint x, y, z;
	vi in(200200), out(200200);
	rep(i, N) {
		tie(x, y) = v[i];
		in[x]++, out[y]++;
	}
	rep(i, 200200) {
		c -= out[i];
		rep(j, in[i]) {
			c++;
			if (c.val() >= 2) a += ((mint)K).pow(N-1);
		}
	}
	cout << a.val() << endl;
}