#include <bits/stdc++.h>
using namespace std;

const int NMAX = 1e5;
vector<int> L[NMAX + 1];
int d[NMAX + 1];

void dfs(int s)
{
    d[s] = 0;
    queue<int> q;
    q.push(s);
    while(!q.empty())
    {
        int node = q.front();
        q.pop();
        for(auto next : L[node])
        {
            if(d[next] == -1)
            {
                d[next] = d[node] + 1;
                q.push(next);
            }
        }
    }
}

int main()
{
    int n, m, s;
    cin>>n>>m>>s;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        cin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
    for(int i = 1; i <= n; i++)
    {
        d[i] = -1;
    }
    dfs(s);
    for(int i = 1; i <= n; i++)
    {
        cout<<d[i]<<" ";
    }
    return 0;
}