#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll MOD;
vector<vector<ll>> matrixmul(int l, int m, int n, vector<vector<ll>> a, vector<vector<ll>> b){
	vector<vector<ll>> c(l, vector<ll>(n));
	for(int i=0; i<l; i++){
		for(int k=0; k<m; k++){
			for(int j=0; j<n; j++){
				(c[i][j]+=a[i][k]*b[k][j])%=MOD;
			}
		}
	}
	return c;
}
vector<vector<ll>> matrixpow(int n, vector<vector<ll>> a, ll k){
	vector<vector<ll>> ap=a, ans(n, vector<ll>(n));
	for(int i=0; i<n; i++) ans[i][i]=1;
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
int main()
{
    int n, m; ll t; cin>>n>>m>>t;
    vector<vector<ll>> mat(n, vector<ll>(n));
    for(int i=0; i<m; i++){
        int a, b; cin>>a>>b;
        mat[a][b]++;
    }
    bool ok[101];
    fill(ok, ok+n, 1);
    random_device rd;
    mt19937 mt(rd());
    uniform_int_distribution rnd(500000000, 1000000000);
    for(int loop=0; loop<3; loop++){
        MOD=rnd(mt);
        auto matp=matrixpow(n, mat, t);
        for(int i=0; i<n; i++) if(matp[0][i]==0) ok[i]=0;
    }
    int ans=0;
    for(int i=0; i<n; i++) if(ok[i]) ans++;
    cout<<ans<<endl;
    return 0;
}