#include <bits/stdc++.h>
#define nmax 100001
#define oo 1e9+5

using namespace std;

vector <int> L[nmax];
int n,m,s,d[nmax];

void citire()
{
    int x,y;
    ifstream fin("bfs.in");
    fin >> n >> m >> s;
    while(m--)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
    fin.close();
}

void bfs(int k)
{
    int nod;
    fill(d+1,d+n+1,oo);
    d[k] = 0;
    queue <int> q;
    q.push(k);
    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        for(auto i : L[nod])
            if(d[i] > d[nod] + 1)
            {
                d[i] = d[nod] + 1;
                q.push(i);
            }
    }
}

void afisare()
{
    ofstream fout("bfs.out");
    for(int i = 1; i <= n; i++)
        if(d[i] == oo) fout << "-1 ";
        else fout << d[i] << " ";
    fout.close();
}

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