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

using namespace std;

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

int const NLim=100001;

vector<int> Muchii[NLim];

queue <int> coada;

int N,M,S,x,y;

int  nivel[NLim];

void bfs()
{
    int nod,vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(int i=0;i< Muchii[nod].size();i++)
        {
            vecin=Muchii[nod][i];
            if(nivel[nod]==-1)
            {
                coada.push(vecin);
                nivel[vecin]=nivel[nod]+1;
            }
        }
    }

}

void Citire()
{
    int nod_start;
    f>>N>>M>>nod_start;
    for(int i=1;i<=M;i++)
    {
        f>>x>>y;
        Muchii[x].push_back(y);
    }
    for(int i=1;i<=N;i++)
    {
        nivel[i]=-1;
    }
    nivel[nod_start]=0;

    coada.push(nod_start);

    bfs();

    for(int i=1;i<=N;i++)
        g<<nivel[i];
}
int main()
{
    Citire();
    return 0;
}