#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <ctime>
#include <cmath>
#define ll long long
using namespace std;

int f[100020];
int n,m,k,T;
int get(){
    char t = getchar();
    while(t < '0' || t > '9')t=getchar();
    int x = 0;
    while(t>='0' && t <= '9'){
        x *= 10;
        x += t-'0';
        t = getchar();
    }
    return x;
}
int main(){
    T = get();
    for(int ii=1;ii<=T;++ii){
        n = get();
        m = get();
        k = get();
        for(int i=1;i<=n;++i)f[i] = m+1;
        f[k] = 0;
        for(int i=1;i<=m;++i){
            int x = get();
            int y = get();
            
            int t1 = min(f[x] + 1, f[y]);
            int t2 = min(f[y] + 1, f[x]);
            f[x] = t1;
            f[y] = t2;
        }
        for(int i=1;i<=n;++i){
            
            if(f[i] > m) f[i] = -1;
            printf("%d",f[i]);
            if(i<n)printf(" ");else printf("\n");
        }
    }
    return 0;
}