#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

#define MAXN 100005

int n, m, s;
vector<int> graph[MAXN];
queue<int> q;
int viz[MAXN];
int dist[MAXN];

void BFS()
{
    int nod = q.front();
    viz[nod] = 1;

    for(int i = 0 ; i < graph[nod].size(); i++)
    {
        if(!viz[graph[nod][i]])
        {
            dist[graph[nod][i]] = dist[nod] + 1;
            q.push(graph[nod][i]);
        }
    }

    q.pop();
}

int main() {
    cin >> n >> m >> s;

    int x, y;

    for(int i = 0; i < m; i++)
    {
        cin >> x >> y;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }

    q.push(s);

    while(!q.empty())
    {
        BFS();
    }

    for(int i = 1; i <= n; i++)
    {
        if(dist[i] == 0 && i != s)
            cout << -1 << " ";
        else
        cout << dist[i] << " ";
    }

    return 0;
}