#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
typedef long long LL;
const int N=100005;
int f[N];
int n,m,k;
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d",&n,&m,&k);
        for (int u=1;u<=n;u++) f[u]=m+1;
        f[k]=0;
        for (int u=1;u<=m;u++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            int A=f[x],B=f[y];
            f[x]=min(A+1,B);
            f[y]=min(B+1,A);
            //f[y]=min(f[y],f[x]);f[x]++;
        }
        for (int u=1;u<=n;u++)
        {
            if (u!=1) printf(" ");
            if (f[u]>m) printf("-1");
            else printf("%d",f[u]);
        }
        printf("\n");
    }
    return 0;
}