#include <bits/stdc++.h>
#define MAXN 100005

using namespace std;

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

int n, m, node, x, y, d[MAXN];
vector <int> g[MAXN];
queue <int> c;

int bfs(int node)
{
    memset(d,-1,sizeof(d));
    d[node]=0;
    c.push(node);
    while (!c.empty())
    {
        int nod=c.front();
        c.pop();
        for (int i=0; i<g[nod].size(); i++)
            if (d[g[nod][i]]==-1)
            {
                d[g[nod][i]]=d[nod]+1;
                c.push(g[nod][i]);
            }
    }
}

int main()
{
    in >> n >> m >> node;
    for (int i=1; i<=m; i++)
    {
        in >> x >> y;
        g[x].push_back(y);
    }
    bfs(node);
    for (int i=1; i<=n; i++)
        out << d[i] << " ";
    return 0;
}