#include <bits/stdc++.h>
using namespace std;

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

int n,m,s,d[100005];
vector<int> v[100005];

void citire()
{
    fin>>n>>m>>s;

    int i,x,y;

    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
}

void BFS(int nod)
{
    queue<int> q;
    q.push(nod);
    d[nod]=0;

    while(!q.empty())
    {
        nod=q.front();
        q.pop();

        for(int i=0; i<v[nod].size(); i++)
            if(d[v[nod][i]]==-1)
            {
                d[v[nod][i]]=d[nod]+1;
                q.push(v[nod][i]);
            }
    }
}

int main()
{
    citire();

    for(int i=1; i<=n; i++)
        d[i]=-1;

    BFS(s);

    for(int i=1; i<=n; i++)
        fout<<d[i]<<" ";

    return 0;
}