#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n,m,i,p,s,x,y;
vector <int> a[100001];
vector <int> d(100001);
queue <int> coada;
int main()
{
    in>>n>>m>>s;
    for (i=1; i<=m; ++i)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    coada.push(s);
    d[s]=1;
    while (!coada.empty())
    {
        x=coada.front();
        for (i=0; i<a[x].size(); ++i)
        {
            if (!d[a[x][i]])
            {
                coada.push(a[x][i]);
                d[a[x][i]]=d[x]+1;
            }
        }
        coada.pop();
    }
    for (i=1; i<=n; ++i)
    {
        if (i==s)
            out<<0<<" ";
        else
            out<<d[i]-1<<" ";
    }
    out<<"\n";
}