#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

#define MAX 7510

typedef long long int lli;

vector <int> G[MAX];
queue <int> coada;

int fr[MAX];

int main()
{
    int n, m, s, a, b, i, j;
    fin>>n>>m>>s;
    for(i=0;i<m;i++)
    {
        fin>>a>>b;
        G[a].push_back(b);
    }
    fr[s]=1;
    coada.push(s);
    while(!coada.empty())
    {
        a=coada.front();
        coada.pop();
        for(i=0;i<G[a].size();i++)
        {
            if(!fr[G[a][i]])
            {
                fr[G[a][i]]=fr[a]+1;
                coada.push(G[a][i]);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        fout<<fr[i]-1<<" ";
    }

    return 0;
}