#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
const ll INF=(1ll<<60);
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
ll modpow(ll a,ll b,ll mod){
    if(b==0) return 1;
    ll p=a,ret=1;
    for(ll i=0;i<=62;i++){
        if(b&(1ll<<i)){
            ret*=p;
            ret%=mod;
        }
        p=(p%mod)*(p%mod);
        p%=mod;
    }
    return ret;
}
int main(){
    const ll mod=998244353;
    ll n,k;
    cin >> n >> k;
    vector<pll> p(n);
    rep(i,n) cin >> p[i].first >> p[i].second;
    sort(all(p));
    ll r=1,x=k;
    priority_queue<ll,vector<ll>,greater<ll>> pq;
    for(auto &[a,b]:p){
        while(!pq.empty()&&pq.top()<=a){
            pq.pop();
            x++;
        }
        r*=x;
        r%=mod;
        x=max(0ll,x-1);
        pq.push(b);
    }
    cout << (modpow(k,n,mod)-r+mod)%mod << endl;
}