#include <bits/stdc++.h>

using namespace std;

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

int n, m, s;
bool vis[100005];
int dmin[100005];

queue < int > Q;

vector < int > L[100005];

///sa zicem ca am matrice de adiacenta prima data
//
//int a[10005][10005];
//void read()
//{   int x, y;
//    fin >> n >> m >> s;
//    for(int i = 1; i <= m; i ++)
//    {
//        fin >> x >> y;
//        a[x][y] = 1;
//    }
//}

void read()
{
    int x, y;
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i ++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
}

void bfs()
{
    int nod;
    Q.push(s);
    dmin[s] = 0;
    while(!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        for(int i = 0; i < L[nod].size(); i ++)
        {
            if(dmin[L[nod][i]] == 1e9)
            {
                dmin[L[nod][i]] = dmin[nod] + 1;
                Q.push(L[nod][i]);
            }
        }
    }
}

int main()
{
    read();
    for(int i = 1; i <= n; i ++)
        dmin[i] = 1e9;

    bfs();
    for(int i = 1; i <= n; i ++)
        if(dmin[i] != 1e9)
            fout << dmin[i] << " ";
        else fout << -1 << " ";

    return 0;
}