///1085422276
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
#include<bitset>
#include<set>
#include<vector>
using namespace std ;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define TS printf("111111\n");
#define FOR(i,a,b) for( int i=a;i<=b;i++)
#define FORJ(i,a,b) for(int i=a;i>=b;i--)
#define READ(a,b) scanf("%d%d",&a,&b)
#define mod 1000000007
#define inf 100000
#define maxn 300000
inline ll read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch<‘0‘||ch>‘9‘)
    {
        if(ch==‘-‘)f=-1;
        ch=getchar();
    }
    while(ch>=‘0‘&&ch<=‘9‘)
    {
        x=x*10+ch-‘0‘;
        ch=getchar();
    }
    return x*f;
}
//******************************************************************
double dp[51][10005];
int n,m,D,vis[10005],jh;
vector<int >G[500];
void dfs(int x,int d)
{
    if(x==jh)return;
    int tmp=G[x].size();
   for(int i=0;i<tmp;i++)
   {
    dp[G[x][i]][d]+=dp[x][d-1]/(tmp);
   }
}
int main()
{

    int T=read();
    while(T--)
    {
        n=read(),m=read(),D=read();
        mem(dp);
        int a,b;
        FOR(i,1,n)G[i].clear();
        FOR(i,1,m)
        {
            READ(a,b);
            G[a].push_back(b);
            G[b].push_back(a);
        }
        FOR(i,1,n){
        mem(dp);   jh=i;
        FOR(j,1,n) dp[j][0]=1.0/n;
        FOR(j,1,D) FOR(k,1,n)dfs(k,j);
        double ans=0.0;
        FOR(j,0,D)ans+=dp[i][j];
        printf("%.10f\n",1-ans);
        }
    }
    return 0;
}