#include <iostream>
#include<fstream>
#include <queue>
#include <vector>
#include <limits.h>
#define NMAX 100001
///BFS.
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,x,y,s,D[NMAX];
vector <int> v[NMAX];
void Citire()
{
    f>>n;
    f>>m;
    f>>s;
    for(int i=1;i<=m;i++)
    {
        f>>x;
        f>>y;
        v[x].push_back(y);
    }
}
void BFS(int Start)
{
    int Curent;
    queue <int> q;
    q.push(Start);
    D[Start]=1;
    while(!q.empty())
    {
        Curent=q.front();
        q.pop();
        for(size_t i=0;i<v[Curent].size();i++)
        {
            if(D[v[Curent][i]]==0)
            {
                D[v[Curent][i]]=D[Curent]+1;
                q.push(v[Curent][i]);
            }
        }
    }
}
void Afisare()
{
    for(int i=1;i<=n;i++)
    {
        if(D[i]!=0)
            g<<D[i]-1<<' ';
        else
            g<<-1<<' ';
    }
}
int main()
{
    Citire();
    BFS(s);
    Afisare();

    return 0;
}