#include <fstream>
#include <string.h>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
struct point {
    int inf;
    point *leg;
    };
queue <int> Q;
point *G[100005],*p;
int T[100010],L[100010];
bool sel[100010];
void bf(int x)
{
    Q.push(x);sel[x]=true;T[x]=0;L[x]=0;
    while (!Q.empty())
    {
        int nod=Q.front();
        point *p;
        p=new point;
        p=G[nod];
        while (p) {
            if (!sel[p->inf])
            {
                Q.push(p->inf);
                T[p->inf]=nod;
                sel[p->inf]=true;
                L[p->inf]=L[nod]+1;
            }
        p=p->leg;
        }
        Q.pop();
    }
}
int main()
{
    int nod,i,x,y,n,m;
    f>>n>>m>>nod;
    memset(G,NULL,sizeof(G));
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        p=new point;
        p->inf=y;
        p->leg=G[x];
        G[x]=p;
    }
    for (i=1;i<=n;i++)
        L[i]=-1;
    bf(nod);
    for (i=1;i<=n;i++)
        g<<L[i]<<' ';
    return 0;
}