#include using namespace std; const long long int MOD = 998233453; vector > mul(vector > a, vector> b) { int n = a.size(); int m = a[0].size(); int k = b[0].size(); vector >c(n, vector(k,0)); for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { for (int k = 0; k < m; k++) { c[i][j] += a[i][k]*b[k][j]; c[i][j]%=MOD; } } } return c; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int n,m,x,y; long long int t; cin >> n >> m >> t; vector >a(n, vector(n,0)); vector >b(n, vector(n,0)); for(int i=0;i> x >> y; a[y][x] = 1; } b[0][0] = 1; while(t > 0) { if(t%2==1) { b = mul(a,b); } a = mul(a,a); t/=2; } int res = 0; for(int i=0;i 0) res += 1; } cout << res << '\n'; return 0; }