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

using namespace std;
ifstream in ("bfs.in");
ofstream out ("bfs.out");
queue <int> coada;
vector<int> graf[100005];
int dist[100005];

void parcurge(int start){
    coada.push(start);
    dist[start] = 0;
    while(coada.size()> 0){
        int nod = coada.front();
        coada.pop();
        for(auto vec:graf[nod]){
            if(dist[nod] + 1 < dist[vec]){
                dist[vec] = dist[nod] + 1;
                coada.push(vec);
            }
        }
    }
}

int main()
{
    int n,m,s;
    in>>n>>m>>s;

    for(int i=0; i<100005; i++){dist[i]=9999999;}

    for(int i=0; i<m; i++){
        int v,x;
        in>>v>>x;
        graf[v].push_back(x);
    }
    parcurge(s);
    for(int i=1; i<=n; i++){
        if(dist[i] == 9999999 ){
            out<<-1<<" ";
        }
        else{
            out<<dist[i]<<" ";
        }
    }

    return 0;
}