#include <fstream>
#include <list>
#include<queue>
#include <set>

using namespace std;

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

int n,m,x,y,nr,s,cost[100003],nou,nod;
bool viz[100003];
list <int>:: iterator it;
list <int> v[100003];
queue <int> c;

int main()
{
    int i;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)     //costul initial este -1;
        cost[i]=-1;
        cost[s]=0;

        c.push(s);           /// adaugam nodul s in coada;

    while(c.size()>0)
    {
        nod=c.front();    // nod= urmatorul element
        viz[nod]=1;
        for(it=v[nod].begin();it!=v[nod].end();++it)
        {
            nou=*it;

            if(viz[nou] == 0 && cost[nou] == -1)
            {
                c.push(nou);
                cost[nou]=cost[nod]+1;
            }

        }
      c.pop();

    }

    for(i=1;i<=n;i++)
        g<<cost[i]<<' ';
    return 0;
}