#include<iostream>
#include<vector>
#include<queue>
#include<fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, x, y, i;
vector<vector<int>> ad;
vector<int> dist;

void bfs(int start)
{
    queue<int> q;
    q.push(start);
    dist[start] = 0;
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(int i:ad[nod])
            if(dist[i] == -1){
                dist[i] = dist[nod] + 1;
                q.push(i);
            }
    }
}

int main()
{
    fin>>n>>m>>s;
    ad.resize(n+1);
    dist.resize(n+1,-1);
    for(i=1;i<=m;i++){
        fin>>x>>y;
        ad[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        fout<<dist[i]<<" ";
    fin.close();
    fout.close();
    return 0;
}