#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

vector <int> v[100];
vector <int> w;
queue <int> q;

int n,m,k;
int viz[100000];

void citire()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&k);
    for(int i=0;i<=n;i++)
         w.push_back(-1);
    w[k]=0;
    int x,y;
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
}

void bfs(int x)
{
    q.push(x);
    viz[x]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        {
            for(int i=0;i<v[nod].size();i++)
            {
                if(viz[v[nod][i]]==0)
                {
                    q.push(v[nod][i]);
                    viz[v[nod][i]]=1;
                    w[v[nod][i]]=w[nod]+1;
                }
            }
        }
    }
}

int main()
{
    citire();
    bfs(k);
    for(int i=1;i<w.size();i++)
        printf("%d ",w[i]);
    return 0;
}