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

using namespace std;

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

vector<vector<int>> v;
vector<int> viz, dist;
queue<int> q;
int n, m, s;

void BFS(int x){
    viz[x] = 1;
    q.push(x);
    dist[x] = 0;
    while(!q.empty()){
        int nod = q.front();
        for(auto &e:v[nod]){
            if(!viz[e]){
                q.push(e);
                viz[e] = 1;
                dist[e] = dist[nod] + 1;
            }
        }
        q.pop();
    }
}

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