#include <bits/stdc++.h>

using namespace std;

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

int n, m, s;
vector<int> vec[100010], sol(100010, -1);
bool vis[100010];

void BFS(int st)
{
    queue<pair<int,int>> q;
    q.push({st,0});
    while(!q.empty())
    {
        int x,t;
        tie(x,t)=q.front();
        q.pop();
        if(vis[x])
            continue;
        vis[x]=true;
        sol[x]=t;
        for(auto it:vec[x])
            q.push({it, t+1});
    }
    for(int i=1; i<=n; i++)
        outf<<sol[i]<<' ';
}

int main()
{
    inf>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        inf>>x>>y;
        vec[x].push_back(y);
    }
    BFS(s);

    return 0;
}