Untitled

#include <bits/stdc++.h>
using namespace std;
#define ld long double
#define ff(i, a, b) for (int i = a; i < b; i++)
#define fr(i, a, b) for (int i = a; i >= b; i--)
#define MP make_pair
#define pii pair<int, int>
#define f first
#define s second
#define endl '\n'
 
#define ll long long
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vpii = vector<pii>;
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define mem(a,b) memset(a,b,sizeof(a))
#define pb push_back
#define parr(a, n)                            \
    do {                                      \
        cerr << #a << " = [";                 \
        for (int i = 0; i < (n); i++) {       \
            cerr << a[i];                     \
            if (i + 1 < (n)) cerr << ", ";    \
        }                                     \
        cerr << "]\n";                        \
    } while (0)
inline ll absll(ll x){ return x < 0 ? -x : x; }
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;
 
#define int long long

int n, m, tar;
vector<vector<pair<int, double>>> g;
double dp[1010][1010];
void solve(){
    cin >> n >> m >> tar;
    g.clear();
    g.resize(n + 1);
    tar /= 10;
    ff(i, 0, m){
        int u, v;
        double p;
        cin >> u >> v >> p;
        g[v].pb(MP(u, p));
    }
    // g[u] will contain all nodes from whom u is 1 step dis 
    
    //dp(u, t) = sum over all v  s.t v->u exist, dp(v, t - 1)*p;
    // ff(i, 1, n + 1){
    //     cout << "for node " << i  << ':' << endl;
    //     for(auto v: g[i]){
    //         cout << v.f << ", ";
    //     }
    //     cout << endl;
    // }
    
    mem(dp, 0.0);
    dp[1][0] = 1.0;
    ff(t, 1, tar + 1){
        ff(v, 1, n + 1){
            for(auto tmp: g[v]){
                int u = tmp.f;
                double p = tmp.s;
                
                dp[v][t] += dp[u][t - 1]*p;
            }
        }
    }
    // ff(t, 0, tar + 1){
    //     ff(i, 1, n + 1){
    //         cout << dp[i][t] << ", ";
    //     }
    //     cout << endl;
    // }
    int id = 0;
    double val = 0.0;
    ff(i, 1, n + 1){
        val = max(val, dp[i][tar]);
        if(val == dp[i][tar]){
            id = i;
        }
    }
    cout << fixed << setprecision(6) << id << ' ' << val << endl;
    
}
 
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    
    cin >> T; 
    while(T--) solve();
    return 0;
}