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

using namespace std;

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

int n, m, start;
queue <int> Q;
vector <int> G[100005];
int c[100005], viz[100005];

void citire()
{
    fin >> n >> m >> start;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        if(x != y)
            G[x].push_back(y);
    }
}

void bfs(int start)
{
    for(int i = 1; i <= n; i++)
        c[i] = -1;
    c[start] = 0;
    Q.push(start);
    viz[start] = 1;
    int nr = 0;
    while(!Q.empty())
    {
        bool ok = false;
        int x = Q.front();
        int l = G[x].size();
        for(int i = 0; i < l; i++)
        {
            if(!viz[G[x][i]])
            {
                if(ok == false)
                {
                    ok = true;
                    nr++;
                }
                Q.push(G[x][i]);
                c[G[x][i]] = nr;
                viz[G[x][i]] = 1;
            }

        }
        Q.pop();

    }
}

void afisare()
{
    for(int i = 1; i <= n; i++)
        fout << c[i] << ' ';
}

int main()
{
    citire();
    bfs(start);
    afisare();
    return 0;
}