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

using namespace std;

ifstream f ("bfs.in");
ofstream g ("bfs.out");

queue < int > Q;
vector < int > v[100001];
vector < int > :: iterator ii;
int vizitat[100001],x,s,n,m,i,y;

void bfs()
{
    Q.push(s);
    vizitat[s] = 1;
    while(!Q.empty())
    {
        x = Q.front();
        ii = v[x].begin();
        while(ii != v[x].end())
        {
            if(!vizitat[*ii])
                vizitat[*ii] = vizitat[x] + 1,Q.push(*ii);
            ii++;
        }
        Q.pop();
    }
}

int main()
{
    f >> n >> m >> s;
    for(i = 1;i <= m;i++)
        f >> x >> y,v[x].push_back(y);
    bfs();
    for(i = 1;i <= n;i++)
        g << vizitat[i] - 1 <<" ";
    return 0;
}