#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

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

void bfs(int start)
{
    viz[start] = 1;
    queue <int> q;
    q.push(start);
    while (!q.empty())
    {
        int v = q.front();
        for (int i = 0; i < G[v].size(); i++)
        {
            int nod = G[v][i];
            if (viz[nod] == 0)
            {
                viz[nod] = viz[v] + 1;
                q.push(nod);
            }
        }
        q.pop();
    }
}

int main()
{
    cin >> n >> m >> s;
    while (m--)
    {
        cin >> x >> y;
        G[x].push_back(y);
    }
    bfs(s);
    for (int i = 1; i <= n; i++)
    {
        cout << viz[i] - 1 << ' ';
    }
    return 0;
}