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

using namespace std;

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

const int N = 100000;
int n,m,s;
vector<int> a[N+1];
int d[N+1];

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

    for(int i=0;i<m;i++){
        int x,y;
        in>>x>>y;
        a[x].push_back(y);
    }

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

    queue<int> q;
    q.push(s);
    d[s] = 0;

    while(!q.empty()){
        int x= q.front();
        q.pop();
        for(auto y : a[x]){
            if(d[y]==-1){
                q.push(y);
                d[y] = 1+d[x];
            }
        }
    }

    for(int i=1;i<=n;i++){
        out<<d[i]<<' ';
    }
    return 0;
}