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

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<int>nod[100005];
queue<int>q;
int i,N,M,S,viz[100005],x,y;

void BFS(int s)
{
    int i,y,x;
    q.push(s);
    viz[s]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0;i<nod[x].size();i++)
        {
            y=nod[x][i];
            if(viz[y]==0)
            {
                q.push(y);
                viz[y]=viz[x]+1;
            }
        }
    }

}

int main()
{
    fin>>N>>M>>S;
    for(i=1;i<=M;++i)
    {
        fin>>x>>y;
        nod[x].push_back(y);

    }
    BFS(S);
    for(i=1;i<=N;++i)
    {
        viz[i]--;
        fout<<viz[i]<<' ';
    }
    return 0;
}