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

using namespace std;

const int NMAX = 1000001;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int N, M, S;
vector<int> muc[NMAX];
int nod[NMAX];

void BFS()
{
    int crt;
    queue<int> Q;
    Q.push(S);
    nod[S] = 0;
    while(!Q.empty())
    {
        crt = Q.back();
        Q.pop();
        for(int i = 0; i < muc[crt].size(); i++)
        {
            if(nod[muc[crt][i]] == -1 || nod[crt] + 1 < nod[muc[crt][i]])
            {
                nod[muc[crt][i]] = nod[crt] + 1;
                Q.push(muc[crt][i]);
            }
        }
    }
}

int main()
{
    fin >> N >> M >> S;
    int x, y;
    for(int i = 1; i <= N; ++i)
        nod[i] = - 1;
    for(int i = 1; i <= M; i++)
    {
        fin >> x >> y;
        muc[x].push_back(y);
    }
    BFS();
    for(int i = 1; i <= N; ++i)
        fout << nod[i] << ' ';
    return 0;
}