#include <bits/stdc++.h>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector<int> graf[100005];
int n,m,x,sol[100005];
queue<int> q;
int main()
{
    in>>n>>m>>x;
    for(int i=0;i<m;i++)
    {
        int a,b;
        in>>a>>b;
        graf[a].emplace_back(b);
    }
    for(int i=1;i<=n;i++)
        sol[i] = -1;
    q.push(x);
    sol[x] = 0;
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(auto it:graf[x])
            if(sol[it] == -1)
            {
                sol[it] = sol[x] + 1;
                q.push(it);
            }
    }
    for(int i=1;i<=n;i++) {
        out<<sol[i]<<' ';
    }
    return 0;
}