#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int N,M,S,d[100005];

queue<int> Q;

vector<int> A[100005];

bool VIZ[100005];

void bf ()
{
    while (!Q.empty())
    {
        int n=Q.front();
        Q.pop();
        int i,v;
        for (i=0;i<A[n].size();++i)
        {
            v=A[n][i];
            if (d[v]==-1)
            {
                Q.push(v);
                d[v]=d[n]+1;
            }
        }
    }
}

int main()
{
    fin >> N >> M >> S;
    int i;
    for (i=1;i<=M;++i)
    {
        int a,b;
        fin >> a >> b;
        A[a].push_back(b);
    }
    for (i=1;i<=N;++i)
    {
        d[i]=-1;
    }
    d[S]=0;
    Q.push(S);
    bf();
    for (i=1;i<=N;++i)
    {
        fout << d[i] << " ";
    }
    return 0;
}