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

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int main()
{
    int n, m, s;
    fin >> n >> m >> s;
    vector <int> adiacente[n+1];
    vector <int> distanta(n+1, -1);

    for (int i = 1; i < m; ++i)
    {
        int x, y;
        fin >> x >> y;
        adiacente[x].push_back(y);
    }

    queue <int> coada;
    vector <bool> vizitat(n+1, false);
    vizitat[s] = 1;
    distanta[s] = 0;

    coada.push(s);
    while (coada.empty() == false)
    {
        int current = coada.front();
        //cout << current << endl;
        coada.pop();
        for(auto w : adiacente[current])
        {
            if(vizitat[w] == false)
            {
                distanta[w] = distanta[current] + 1;
                vizitat[w] = true;
                coada.push(w);
                //cout << "adaug " << adiacente[current][i] << endl;
            }
        }
    }

    for (int i = 1; i <= n; ++i)
        fout << distanta[i];
    fout << endl;

    return 0;
}