#include <iostream>
#include <stdio.h>
#include <queue>
using namespace std;

#define NMAX 100000
vector <int> g[100];
queue <int> q;
bool v[NMAX];
int c[NMAX];

void functie(int s)
{
    q.push(s);
    int p[NMAX];
    v[s]=1;
    p[s]=s;
    while(q.size()!=0)
   {
        for(int j=0; j<g[s].size(); j++)
        {
            if(v[g[s][j]]==0)
           {
               q.push(g[s][j]);
               p[g[s][j]]=s;
           }
        }

        v[s]=1;
         if(s!=p[s])
        c[s]=c[p[s]]+1;
        q.pop();
        s=q.front();

   }
}

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

    int n, m, s, x, y;
    scanf("%d %d %d \n", &n, &m, &s);

    for(int i=1; i<=m; i++)
    {
        scanf("%d %d \n", &x, &y);
        g[x].push_back(y);
    }

    functie(s);
    for(int i=1; i<=n; i++)
        if(v[i]==1)
         printf("%d ",c[i]);
        else
         printf("%d ",-1);





    return 0;
}