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

#define N 100005

using namespace std;

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

int n, m, s, d[N];
bool viz[N];
queue < int > q;
vector <int> L[N];
void adaugareElemente()
{
    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(nod);
    int k;
    while(!q.empty())
    {
        k = q.front();
        q.pop();
        for(int i = 0; i < L[k].size(); i++)
            if((d[L[k][i]] > d[k] + 1) || (!viz[L[k][i]]))
            {
                q.push(L[k][i]);
                d[L[k][i]] = d[k] + 1;
                viz[L[k][i]] = 1;
            }
    }
}

int main()
{
    adaugareElemente();
    viz[s] = 1;
    BFS(s);
    for(int i = 1; i <= n; i++)
        if(viz[i])
            fout << d[i] << " ";
        else
            fout << -1 << " ";
    fout << "\n";
    return 0;
}