#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;



typedef struct { int i, k; } RNode;
RNode rs[200004];
bool mycmp(const RNode& a, const RNode& b) {
    if (a.i!=b.i) return a.i<b.i;
    return a.k<b.k;
}
#define MOD 998244353

int main() {
    int n, i, k, ck, s, e, j, nj, d, cc, c;
    LL b, r, bb, v, t;
    scanf("%d %d", &n, &k);
    c=0;
    for (i=0; i<n; i++) {
        scanf("%d %d", &s, &e);
        rs[c].i=s; rs[c].k=1; c++;
        rs[c].i=e; rs[c].k=-1; c++;
    }
    r=1; for (i=1; i<=n; i++) { r*=k; r%=MOD; }
    sort(rs, rs+c, mycmp);
    bb=1;
    cc=0;
    for (i=0; i<c; i++) {
        j=rs[i].k; if (j<0) cc--; else {
            if (cc>=k) { bb=0; break; }
            bb*=(k-cc); bb%=MOD;
            cc++;
        }
    }
    r-=bb; if (r<0) r+=MOD;
    printf("%lld\n", r);
    return 0;
}