#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int INF = -1;

int n, m, s;
int d[100005];
vector<int> v[100005];

void bfs()
{
    queue<int> q;
    q.push(s);
    d[s] = 0;

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

        for(auto it: v[node])
        {
            if(d[it] == INF)
            {
                d[it] = d[node] + 1;
                q.push(it);
            }
        }
    }
}

int main()
{
    in >> n >> m >> s;

    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        v[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
        d[i] = INF;

    bfs();

    for(int i = 1; i <= n; i++)
        out << d[i] << ' ';

    return 0;
}