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

using namespace std;

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

const int N= 100000 + 2;
int n, m, s, dist[N];
vector <int> drm[N];

int main()
{
    in >> n >> m >> s;
    for(int i=1; i<=m; i++){
        int x, y;
        in >> x >> y;
        drm[x].push_back(y);
    }

    for(int i=1; i<=n; i++){
        dist[i] = -1;
    }
    dist[s] = 0;

    //bfs
    queue <int> q;
    q.push(s);

    while ( !q.empty() ){

        int nd = q.front();
        q.pop();

        for(auto i: drm[nd] ){
            if( dist[i] == -1 ){
                dist[i] = dist[nd] + 1;
                q.push(i);
            }
        }
    }

    for(int i=1; i<=n; i++){
        out<< dist[i] << " ";
    }

    return 0;
}