#include <bits/stdc++.h>

using namespace std;

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

int n, m, s, x, y;
int cost[100001];
vector<int>G[100001];

void BFS(int node)
{
    queue<int>coada;
    cost[node]=1;
    coada.push(node);
    while(!coada.empty())
    {
        int aux=coada.front();
        coada.pop();
        for(int i=0; i<G[aux].size(); ++i)
        {
            if(cost[G[aux][i]]==0)
            {
                cost[G[aux][i]]=cost[aux]+1;
                coada.push(G[aux][i]);
            }
        }
    }
}

int main()
{
    fin>>n>>m>>s;
    for(int i=1; i<=m; ++i)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    BFS(s);
    for(int i=1; i<=n; ++i) fout<<cost[i]-1<<" ";
    return 0;
}