#include <fstream>
#include <vector>
#include <queue>
#define nmax 100002
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

queue <int> coada;
vector <int> v[nmax];
int dist[nmax],n,m,s,x,y;

inline void citire ()
{
    fin>>n>>m>>s;
    for (int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
}
inline void bfs ()
{
    dist[s]=1;
    coada.push(s);
    while (!coada.empty())
    {
        int nod=coada.front();
        int lg=v[nod].size();
        coada.pop();
        for (int i=0;i<lg;i++)
        {
            if (!dist[v[nod][i]])
            {
                dist[v[nod][i]]=dist[nod]+1;
                coada.push(v[nod][i]);
            }
        }
    }
}
inline void afisare ()
{
    for (int i=1;i<=n;i++)
        fout<<dist[i]-1<<" ";
}
int main()
{
    citire();
    bfs();
    afisare();
    return 0;
}