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

using namespace std;

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

const int nmax= 100000;

vector <int> v[nmax+1];
queue <int> q;
int d[nmax+1];

int main(  ) {
    int n, m, p;
    fin>>n>>m>>p;

    for ( int i= 1; i<=m; ++i ) {
        int x, y;
        fin>>x>>y;
        v[x].push_back(y);
    }

    for ( int i= 0; i<=nmax; ++i ) {
        d[i]= -1;
    }

    d[p]= 0;
    q.push(p);
    while ( q.size()>0 ) {
        for ( int i= 0; i<(int)v[q.front()].size(); ++i ) {
            if ( d[v[q.front()][i]]==-1 ) {
                d[v[q.front()][i]]= d[q.front()]+1;
                q.push(v[q.front()][i]);
            }
        }
        q.pop();
    }

    for ( int i= 1; i<=n; ++i ) {
        fout<<d[i]<<" ";
    }
    fout<<"\n";

    return 0;
}