#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

vector<int> adj[100001];
int viz[100001];
int arce[100001];

void BFS(vector<int> adj[],int start,int viz[],int arce[]) {

    // ofstream fout("bfs.out");

    queue<int> Q;
    Q.push(start);
    viz[start]=1;

    while (Q.size()>0) {
        int nod=Q.front();
        // fout<<nod<<' ';
        Q.pop();
        for (int vecin:adj[nod]) {
            if (viz[vecin]==0) {
                arce[vecin]=arce[nod]+1;
                viz[vecin]=1;
                Q.push(vecin);
            }
        }
    }

}

int main() {

    int M,N,S;
    int x,y;


    ifstream fin("bfs.in");
    fin>>N>>M>>S;

    for (int i=1;i<=N;i++) {
        adj[i].clear();
        viz[i]=0;
    }

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

    arce[S]=0;
    BFS(adj,S,viz,arce);

    for (int i=1;i<=N;i++) {
        if (viz[i]==0) arce[i]=-1;
    }

    ofstream fout("bfs.out");
    for (int i=1;i<=N;i++) {
        fout<<arce[i]<<' ';
    }
}