#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define max(x...) max({x})
#define min(x...) min({x})
#define FOR(i, x, y) for(int i = (x); i <= (y); i++)
#define ROF(i, x, y) for(int i = (x); i >= (y); i--)
inline int rd()
{
    int sign = 1, re = 0; char c = getchar();
    while(!isdigit(c)){if(c == '-') sign = -1; c = getchar();}
    while(isdigit(c)){re = re * 10 + (c - '0'); c = getchar();}
    return sign * re;
}
namespace MOD
{
    const int mod = 998244353;
    inline int add(int a, int b) {return a + b >= mod ? a + b - mod : a + b;}
    inline int mul(int a, int b) {return 1ll * a * b % mod;}
    inline int sub(int a, int b) {return a - b < 0 ? a - b + mod : a - b;}
    inline int fast_pow(int a, int b = mod - 2)
    {
        int re = 1;
        while(b)
        {
            if(b & 1) re = mul(re, a);
            a = mul(a, a);
            b >>= 1;
        }
        return re;
    }
} using namespace MOD;
int n, m, c;
bitset<105> rg[105];
vector<int> a[105];
int dp[105][105][105];
int dfs(int i, int j, int x)
{
    if(!x) return 0;
    if(i > j) return 1;
    if(~dp[i][j][x]) return dp[i][j][x];
    int &f = dp[i][j][x]; f = 0;
    f = add(f, dfs(i + 1, j, x));
    FOR(k, i + 1, j) if(rg[i][k - 1])
        f = add(f, mul(dfs(i, k - 1, x - 1), dfs(k + 1, j, x)));
    if(rg[i][j]) f = add(f, dfs(i, j, x - 1));
    return f;
}
signed main()
{
#ifndef ONLINE_JUDGE
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif
    n = rd(), m = rd(), c = rd();
    FOR(i, 1, m)
    {
        int l = rd(), r = rd();
        a[l].emplace_back(r);
    }
    FOR(i, 1, n) sort(a[i].begin(), a[i].end());
    FOR(i, 1, n) if(!a[i].empty())
    {
        FOR(j, a[i][0], n)
        {
            int Mx = a[i][0];
            FOR(k, i, Mx + 1) if(!a[k].empty())
            {
                auto it = upper_bound(a[k].begin(), a[k].end(), j);
                if(it == a[k].begin()) continue;
                it--, Mx = max(Mx, *it);
            }
            if(Mx == j) rg[i][j] = 1;
        }
    }
    memset(dp, -1, sizeof(dp));
    if(c <= n)
    {
        dfs(1, n, c);
        printf("%d", dp[1][n][c]);
        return 0;
    }
    dfs(1, n, n + 1);
    int ans = 0;
    FOR(i, 1, n + 1)
    {
        int t = 1;
        FOR(j, 1, n + 1) if(i != j)
            t = mul(t, mul(sub(c, j), fast_pow(sub(i, j))));
        ans = add(ans, mul(dp[1][n][i], t));
    }
    printf("%d", ans);
    return 0;
}