#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int NMAX = 100000;
vector<int> g[NMAX + 1];
int n, m, s;
int viz[NMAX + 1];

void bfs(int start)
{
    for(int i = 1; i <= n; ++i)
        viz[i] = -1;

    viz[start] = 0;
    queue<int> q;
    q.push(start);

    while(!q.empty())
    {
        int v = q.front();
        q.pop();

        for(int i = 0; i < g[v].size(); ++i)
        {
            if(viz[g[v][i]] == -1)
            {
                q.push(g[v][i]);
                viz[g[v][i]] = viz[v] + 1;
            }
        }
    }
}

int main()
{
    in >> n >> m >> s;
    int u, v;
    for(int i = 1; i <= m; ++i)
    {
        in >> u >> v;
        g[u].push_back(v);
    }

    bfs(s);

    for(int i = 1; i <= n; ++i)
    {
        out << viz[i] << ' ';
    }
    return 0;
}