#include <fstream>
#include <queue>

#define Ndim 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int V[Ndim];
vector <int> G[Ndim];
queue <int> Q;
int main()
{
    int n,m,s,i,a,b,nod,fiu;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        G[a].push_back(b);
    }
    for(i=1;i<=n;i++)
        V[i] = -1;
    V[s] = 0;
    Q.push(s);
    while(!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        for(i=0;i<G[nod].size();i++)
        {
            fiu = G[nod][i];
            if(V[fiu] == -1)
            {
                V[fiu] = V[nod]+1;
                Q.push(fiu);
            }
        }
    }
    for(i=1;i<=n;i++)
        fout<<V[i]<<' ';

    return 0;
}