//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> void fin(T a) { cout << a << '\n'; exit(0); }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

template<typename T>
struct matrix {
    int h, w;
    vector<vector<T>> v;
    
    constexpr matrix(int h, int w, T t) : h(h), w(w), v(vector<vector<T>>(h, vector<T>(w, t))) {}
    
    constexpr matrix(vector<vector<T>> v) : v(v), h(v.size()), w(v[0].size()) {}
    
    constexpr matrix &operator+=(const matrix &a) {
        rep(i, h) rep(j, w) v[i][j] += a.v[i][j];
        return *this;
    }
    
    constexpr matrix &operator*=(const int &k) {
        rep(i, h) rep(j, w) v[i][j] *= k;
        return *this;
    }
    
    constexpr matrix &operator-=(const matrix &a) {
        *this += a * (-1);
        return *this;
    }
    
    constexpr matrix operator+(const matrix &a) const { return res(*this) += a; }
    
    constexpr matrix operator*(const int &k) const { return res(*this) *= k; }
    
    constexpr matrix operator-(const matrix &a) const { return res(*this) -= a; }
    
    constexpr matrix operator*(const matrix &a) const {
        matrix res(h, a.w, 0);
        rep(i, h) rep(j, a.h) rep(k, a.w) res.v[i][k] = res.v[i][k] + v[i][j] * a.v[j][k];
        return res;
    }
    
    constexpr matrix &operator*=(const matrix &a) { return *this = *this * a; }
    
    constexpr matrix pow(ll t) const {
        matrix res(h, w, 0), a(*this);
        rep(i, h) res.v[i][i] = T(1);
        while (t > 0) {
            if (t & 1) res *= a;
            t >>= 1;
            a *= a;
        }
        return res;
    }
    
    vector<T> &operator[](int i) {
        assert(i < h);
        return v[i];
    }
};

struct f2 {
    int x;
    
    f2(int x = 0) : x(x) {}
};

f2 operator*(const f2 &a, const f2 &b) {
    return f2(a.x & b.x);
}

f2 operator+(const f2 &a, const f2 &b) {
    return f2(a.x | b.x);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    INT(n, m);
    LL(t);
    vector init(n, vector(1, f2()));
    init[0][0].x = 1;
    auto init_m = matrix<f2>(init);
    vector trans(n, vector(n, f2()));
    rep(_, m) {
        INT(a, b);
        trans[b][a] = 1;
    }
    auto trans_m = matrix<f2>(trans);
    auto ans = trans_m.pow(t) * init_m;
    int cnt = 0;
    rep(i, n) cnt += ans.v[i][0].x;
    print(cnt);
}