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

using namespace std;

vector<int>a[100005];
int n, m, s;
int dp[100005];

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

void bfs(int x1)
{
    queue <int> q;
    dp[x1]=0;
    q.push(x1);
    while(!q.empty())
    {
        int x;
        x=q.front();
        q.pop();
        for(auto y : a[x])
        {
            if(dp[y]==-1)
            {
                dp[y]=dp[x]+1;
                q.push(y);
            }
        }
    }

}

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++)
    {
        dp[i]=-1;
    }
    bfs(s);
    for(int i=1; i<=n; i++)
    {
        out<<dp[i]<<" ";
    }

    return 0;
}