#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#define Nmax 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> G[Nmax];
queue <int> Q;
int N,M,S;
int C[Nmax];

void Read()
{
    fin>>N>>M>>S;
    while(M--)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
}

void BFS()
{
    for(int i=1;i<=N;++i)
        C[i]=-1;
    Q.push(S);
    C[S]=0;
    while(!Q.empty())
    {
        int Node=Q.front(); Q.pop();
        for(int i=0;i<G[Node].size();++i)
        {
            int Vecin=G[Node][i];
            if(C[Vecin]==-1)
            {Q.push(Vecin);
             C[Vecin]=C[Node]+1;
            }
        }
    }
}

void Print()
{
    for(int i=1;i<=N;++i)
        fout<<C[i]<<" ";
}

int main()
{
    Read(); BFS(); Print();
    return 0;
}