#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 666666
int T,n,m,k,u[SZ],v[SZ],f[SZ];
void sol() {
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;++i) f[i]=(i==k)?0:1e9;
    for(int i=1,p,q;i<=m;++i) {
        scanf("%d%d",&p,&q);
        if(p==q) continue;
        int fp=f[p],fq=f[q];
        f[p]=min(fq,fp+1);
        f[q]=min(fp,fq+1);
    }
    for(int i=1;i<=n;++i) {
        int F=f[i];
        if(F>1e8) F=-1;
        printf("%d%c",F," \n"[i==n]);
    }
}
int main()
{
    scanf("%d",&T);
    while(T--) sol();
}