#include <cstdio>
#include <vector>
using namespace std;
vector<int> g[100004];
int i,m,n,s,t[100004],lg[100004],q[100004],p,u,x,y;
bool sel[100004];
void bfs (int nod)
{
    int p,i,u;
    sel[nod]=true;
    q[1]=nod;
    p=u=1;
    while (p<=u)
    {
        x=q[p];
        for (i=0;i<g[x].size();i++)
            if (sel[g[x][i]]==false)
            {
            y=g[x][i];
            q[++u]=y;
            sel[y]=true;
            t[y]=x;
            lg[y]=lg[x]+1;
            }
        p++;
     }
}
int main()
{
    freopen ("bfs.in","r",stdin);
    freopen ("bfs.out","w",stdout);
    scanf ("%d %d %d", &n, &m, &s);
    for (i=1;i<=m;i++)
    {
        scanf ("%d %d", &x, &y);
        g[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        lg[i]=-1;
    lg[s]=0;
    bfs (s);
    for (i=1;i<=n;i++)
    printf ("%d ", lg[i]);
    return 0;
}