#include <fstream>
#include <queue>

#define NMAX 100007

using namespace std;

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

vector < int > v[NMAX];
queue < int > q;
int Viz[NMAX];
int n, m, Start;

void bfs(int Node){
    q.push(Node);
    while(! q.empty()){
        Node = q.front();
        q.pop();
        for(vector < int > :: iterator it = v[Node].begin(); it != v[Node].end(); ++it)
            if(Viz[*it] == 0){
                Viz[*it] = Viz[Node] + 1;
                q.push(*it);
            }
    }
}

int main(){
    cin >> n >> m >> Start;
    for(int i = 1; i <= m; ++i){
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
    }
    Viz[Start] = 1;
    bfs(Start);
    for(int i = 1; i <= n; ++i)
        cout << Viz[i] - 1 << " ";
    return 0;
}