#include <fstream>
#include <vector>

using namespace std;

vector <int> v[100010];
int viz[100010],q[100010];
int q1,q2,j,dist,d[100010];
int n,m,x,i,a,b;

void bfs (int nod)
{
    q1=1;
    q2=1;
    viz[nod]=1;
    q[q2]=nod;
    d[nod]=0;
    while (q1<=q2)
    {
        for (j=0; j<v[q[q1]].size(); j++)
        {
            if (viz[v[q[q1]][j]]==0)
            {
                viz[v[q[q1]][j]]=1;
                q2++;
                q[q2]=v[q[q1]][j];
                d[q[q2]]=d[q[q1]]+1;
            }
        }
        q1++;
    }
}

int main()
{
    freopen ("bfs.in","r",stdin);
    freopen ("bfs.out","w",stdout);

    scanf ("%d",&n);
    scanf ("%d",&m);
    scanf ("%d",&x);

    for (i=1; i<=m; i++)
    {
        scanf ("%d",&a);
        scanf ("%d",&b);
        v[a].push_back(b);
    }

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

    bfs(x);

    for (i=1; i<=n; i++)
    {
        printf ("%d ",d[i]);
    }

    printf ("\n");

    return 0;
}