#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int NMAX = 1e5 + 5;
vector<int> vec[NMAX];
int n, m, s, dist[NMAX];

void bfs()
{
    memset(dist, -1, sizeof(dist));
    queue<int> q;
    dist[s] = 0;
    q.push(s);
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        for(auto nod : vec[x])
        {
            if(dist[nod] == -1)
            {
                dist[nod] = dist[x] + 1;
                q.push(nod);
            }
        }
    }
}

signed main()
{
    fin >> n >> m >> s;
    while(m--)
    {
        int i, j;
        fin >> i >> j;
        vec[i].push_back(j);
    }
    bfs();
    for(int i = 1; i <= n; i++)
        fout << dist[i] << " ";

    return 0;
}