#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m,viz[100001],s,cost[100001];

queue  <int> c;
vector <int> a[100001];

void citire()
{
    int i,j,k;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>j>>k;
        a[j].push_back(k);
    }
}

int bfs(int x)
{
    int p,j,v;
    viz[x]=1;
    c.push(x);
    while(c.size()!=0)
    {
        p=c.front();
        for(j=0;j<a[p].size();j++)
        {
            v=a[p][j];
            if(viz[v]==0)
            {
                viz[v]=1;
                c.push(v);
                cost[v]=cost[p]+1;
            }

        }
        c.pop();
    }
}
int main()
{
    int i;
    citire();
    bfs(s);
    for(i=1;i<=n;i++)
        if(cost[i]!=0 || i==s)
            g<<cost[i]<<" ";
        else
            g<<-1<<" ";
    return 0;
}