#include <bits/stdc++.h>
#include <fstream>
#define INF INT_MAX

using namespace std;

vector<int> la[100001];
queue<int> q;

int n,m,s,x,y,D[100001];

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

void Citire()
{
    fin >> n;
    fin >> m;
    fin >> s;
    for(int i = 0; i < m; i++)
    {
        fin >> x;
        fin >> y;
        la[x].push_back(y);
    }

}

void BFS(int start)
{
    int curent, vecin;
    D[start] = 1;
    q.push(start);
    while(!q.empty())
    {
        curent=q.front();
        q.pop();
        for(int i = 0; i < la[curent].size(); i++)
            vecin = la[curent][i];
            if(D[vecin] == 0)
            {
                D[vecin] = D[curent]+1;
                q.push(vecin);
            }
    }
}

void Afisare()
{
    for(int i = 1; i <= n; i++)
    {
        if(D[i] != INF)
            fout << D[i] - 1 << " ";
        else
            fout << -1 << " ";
    }
}

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