#include<fstream>
#include<vector>
#include<queue>
#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,Cost[NMAX];

void Read()
{
    fin>>N>>M>>S;
    for(int i=1;i<=M;++i)
    {
        int x,y;
        G[x].push_back(y);
    }
    for(int i=1;i<=N;++i)
        Cost[i]=-1;
    Cost[S]=0;
    Q.push(S);
}

void BFS()
{
    int Node,Vec;
    while(!Q.empty())
    {
        Node=Q.front();
        for(unsigned int i=0;i<G[Node].size();++i)
        {
            Vec=G[Node][i];
            if(Cost[Vec]==-1)
            {
                Q.push(Vec);
                Cost[Vec]=Cost[Node]++;
            }
        }
        Q.pop();
    }

}

int main()
{
    Read();
    BFS();
    for(int i=1;i<=N;i++)
        fout<<Cost[i]<<" ";
    return 0;
}