#include <iostream>
#include <vector>
#include <cstdio>
#include <bitset>
#include <queue>

using namespace std;

queue <int> q;

bitset <100005> viz;

vector <int> g[100005];

int d[100005];

int n,m,s,f, start;

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    scanf("%d %d %d", &n, &m, &start);

    for(int i=0;i<m;++i){
        scanf("\n%d %d", &s, &f);
        g[s].push_back(f);
    }

    q.push(start);
    viz[start]=1;

    while(!q.empty()){
        int c=q.front();
        q.pop();

        for(auto i : g[c]){
            if(!viz[i]){
                q.push(i);
                d[i]=d[c]+1;
            }
        }
    }

    for(int i=1;i<=n;++i){
        if(d[i]!=0 || i==start)
            cout<<d[i]<<" ";
        else
            cout<<"-1 ";
    }

    return 0;
}