#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int lim=1e5+4;
vector<int> vec[lim];
queue<int> q;
int dp[lim];
int main()
{
    int n,m,src,x,y;
    in>>n>>m>>src;
    for(int i=1;i<=n;++i)
        dp[i]=-1;
    for(int i=1;i<=m;++i)
    {
        in>>x>>y;
        vec[x].push_back(y);
    }
    dp[src]=0;
    q.push(src);
    while(!q.empty())
    {
        int x=q.front(); q.pop();
        for(int y:vec[x])
        if(dp[y]==-1)
        {
            dp[y]=dp[x]+1;
            q.push(y);
        }
    }
    for(int i=1;i<=n;++i)
        out<<dp[i]<<' ';
    return 0;
}