#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

const int NMAX = 100000;
vector <int> G[NMAX + 1];
int vis[NMAX + 1];
int d[NMAX + 1];

void BFS(int x)
{
    queue<int> q;
    q.push(x);
    d[x] = 0;
    vis[x] = 1;
    while (!q.empty())
    {
        x = q.front();
        q.pop();
        for (auto next : G[x])
        {
            if (!vis[next])
            {
                q.push(next);
                vis[next] = 1;
                d[next] = d[x] + 1;
            }
        }
    }
}

int main()
{
    int n, m,sursa;
    f >> n >> m;
    f>>sursa;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    BFS(sursa);
    for (int i = 1; i <= n; i++)
        g << d[i];

}