#include <iostream>
#include <fstream>
#include <queue>
#define Nmax 1000010
using namespace std;
ifstream fin("bfs.in");
ofstream gout("bfs.out");

queue <int> Q;
vector <int> G[Nmax];
int n,m,s,x,y,viz[Nmax],v;
int di[4]={-1,0,0,1};
int dj[4]={0,-1,1,0};

void citire()
{
    fin>>n>>m>>s;
    for(int i=0;i<m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}

void verif(int v)
{
    Q.push(v);
    viz[v]=1;
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        for(vector <int> :: iterator it=G[x].begin();it!=G[x].end();++it)
            if(!viz[*it])
            {
                Q.push(*it);
                viz[*it]=1+viz[x];
            }
    }
}

int main()
{
    citire();
    verif(s);
    for(int i=1;i<=n;i++)
        gout<<viz[i]-1<<" ";
    return 0;
}