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

using namespace std;

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

vector <int> v[100005];
queue <int> q;

int noduri[100005],n,m;

int bfs(int nod)
{
    int k,j;
    noduri[nod]=0;
    q.push(nod);
    while(!q.empty())
    {
        k=q.front();q.pop();
        for(j=0; j<v[k].size(); ++j)
            if(noduri[v[k][j]]==-1)
            {
                noduri[v[k][j]]=noduri[k]+1;
                q.push(v[k][j]);
            }

    }

}

int main()
{
    int i,s,x,y;

    fin>>n>>m>>s;
    for(i = 1; i <= m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        noduri[i]=-1;
    bfs(s);
    for(i=1;i<=n;i++)
        fout<<noduri[i]<<' ';
}