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

using namespace std;

ifstream fi("bfs.in");
ofstream fo("bfs.out");

vector <int> G[1000060];
queue  <int> Q;

long int sir[1000060],viz[1000060];
long int n,m,s;

void bfs(long int node)
{
    long int nod;
    viz[node]=1;

    Q.push(node);

    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();

        for(long int i=0;i<G[nod].size();i++)
            if(viz[G[nod][i]]==0)
                {viz[G[nod][i]]=1;
                sir[G[nod][i]]=sir[nod]+1;
                Q.push(G[nod][i]);}
    }

}

int main()
{
    fi>>n>>m>>s;

    for(long int i=0;i<m;i++)
    {
        long int x,y;

        fi>>x>>y;

        G[x].push_back(y);
    }

    bfs(s);

    for(long int i=1;i<=n;i++)
        if(viz[i]==0)
            fo<< -1<<" ";
        else
            fo<< sir[i]<<" ";

    return 0;

}