#include <fstream>
#include <vector>
using namespace std;

ifstream f("f1.in");
ofstream g("f1.out");
int N, M, L, Start,x,y,i;
vector<int> A[100010];
int G[100010], S[100010], Cost[100010];
void BFS(int nod)
{
    int i, j;
    for(i=1;i<=N;i++)
        Cost[i]=-1;
    L = 1;
    Cost[nod] = 0;
    S[L] = nod;
    for (i = 1; i <= L; i++)
        for (j = 0; j < G[S[i]]; j++)
                if (Cost[A[S[i]][j]] == -1)
            {
                S[++L] = A[S[i]][j];
                Cost[S[L]] = Cost[S[i]] + 1;
            }
}

int main()
{
    f>>N>>M>>Start;
    for (i = 1; i <= M; i++)
    {
        f>>x>>y;
        A[x].push_back(y);
    }

    for (i = 1; i <= N; i++)
        G[i] = A[i].size();
    BFS(Start);
    for (i = 1; i <= N; i++)
        g<<Cost[i]<<" ";
    g<<'\n';
    return 0;
}