#include using namespace std; typedef long long ll; typedef vector VI; typedef vector VVI; typedef vector VL; typedef vector> VVL; typedef pair Pair; typedef tuple tpl; #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define REVERSE(c) reverse((c).begin(),(c).end()) #define EXIST(m,v) (m).find((v)) != (m).end() #define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin() #define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin() #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i) #define RREP(i,n) RFOR(i,n,0) #define en "\n" constexpr double EPS = 1e-9; constexpr double PI = 3.1415926535897932; constexpr int INF = 2147483647; constexpr long long LINF = 1LL<<60; constexpr long long MOD = 1000000007; // 998244353; template inline bool chmax(T& a, T b){if(a inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;} template vector> matdot(vector>& A, vector>& B){ int n = A.size(), m = B.size(), l = B[0].size(); vector> ret(n, vector(l,0)); for(int i=0; i void matpow(vector>& dp, vector>& mat, long long k){ while(k){ if(k & 1) dp = matdot(mat, dp); mat = matdot(mat, mat); k >>= 1; } } void Main(){ ll N,M,T; cin >> N >> M >> T; vector> mat(N,vector(N,false)); REP(_,M){ int a,b; cin >> a >> b; mat[b][a] = true; } vector> dp(N,vector(1,false)); dp[0][0] = true; matpow(dp,mat,T); int ans = 0; REP(i,N) if(dp[i][0]) ans++; cout << ans << en; return; } int main(void){ cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<>t; REP(_,t) Main(); return 0; }