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

using namespace std;

ofstream out("bfs.out");
vector <int> g[100001];
queue <int> q;
int n,m,s,x[100001];

void citire()
{
    ifstream f("bfs.in");
    f>>n>>m>>s;
    q.push(s);
    x[s]=1;
    for(int i=1; i<=m; i++)
    {
        int aux1,aux2;
        f>>aux1>>aux2;
        g[aux1].push_back(aux2);
    }
}

void bfs()
{while(!q.empty())
{int aux=q.front();
q.pop();
for(auto &v: g[aux])
{if(!x[v])
{q.push(v);
x[v]=x[aux]+1;


}

}
}
}


void afisare()
{
    for(int i=1; i<=n; i++)
        out<<x[i]-1<<" ";
}

int main()
{
    citire();
    bfs();
    afisare();


    return 0;
}