#include <bits/stdc++.h>

using namespace std;

const int Nmax = 100005;
vector <int> L[Nmax];
bitset <Nmax> viz;
queue <int> q;
int d[Nmax], n, s;

void Citire()
{
    ifstream f("bfs.in");
    int m, i, x, y;
    f >> n >> m >> s;
    for (i  = 1; i <= m; i++)
    {
        f >> x >>  y;
        L[x].push_back(y);
    }
    f.close();
}

void BFS(int nod)
{
    viz[nod] = 1;
    q.push(nod);
    for(int i = 1; i <= n; i++)
        d[i] = -1;
    d[nod] = 0;
    while(!q.empty())
    {
        int k = q.front();
        q.pop();
        for(unsigned int i = 0; i < L[k].size(); i++)
        {
            int j = L[k][i];
            if(viz[j] == 0)
            {
                d[j] = d[k] + 1;
                viz[j] = 1;
                q.push(j);
            }
        }
    }
}

void Afisare()
{
    ofstream g("bfs.out");
    for(int i = 1; i <= n; i++)
        g << d[i] << " ";
    g << "\n";
    g.close();
}

int main()
{
    Citire();
    BFS(s);
    Afisare();
    return 0;
}