#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

using Vec = vector<int>;
using Mat = vector<Vec>;

Mat Mul(const Mat& A, const Mat& B){
    Mat C(A.size(), Vec(B.size()));
    for(int i = 0; i < (int)A.size(); ++i){
        for(int k = 0; k < (int)A[i].size(); ++k){
            for(int j = 0; j < (int)B.size(); ++j){
                C[i][j] |= A[i][k] & B[k][j];
            }
        }
    }
    return C;
}

Mat Pow(Mat A, ll n){
    Mat B(A.size(), Vec(A.size()));
    for(int i = 0; i < (int)A.size(); ++i)  B[i][i] = 1;
    while(n > 0){
        if(n & 1)   B = Mul(B, A);
        A = Mul(A, A);
        n >>= 1;
    }
    return B;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M, T;
    cin >> N >> M >> T;
    vector<vector<int>> g(N, vector<int>(N));
    vector<int> outdeg(N);
    for(int i = 0; i < M; ++i){
        int a, b;
        cin >> a >> b;
        g[a][b] = 1;
        outdeg[a] += 1;
    }
    g = Pow(g, T + 1);
    int ans = 0;
    for(int i = 0; i < N; ++i)  ans += g[0][i] & (outdeg[i] > 0);
    cout << ans << endl;

    return 0;
}