#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

vector<int>lista[100001];
queue<int>q;
int n,m,s,d[100001],viz[100001];

void citire()
{
    in>>n>>m>>s;
    int x,y;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        lista[x].push_back(y);
    }
}
void bfs(int node)
{
    q.push(node);
    viz[node]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto x:lista[nod])
        {
            if(!viz[x])
            {
                q.push(x);
                viz[x]=1;
                d[x]=d[nod]+1;
            }
        }
    }
}
int main()
{
    citire();
    bfs(s);
    for(int i=1;i<=n;i++)
    {
        if(viz[i])
            out<<d[i]<<' ';
        else
            out<<"-1 ";
    }
    return 0;
}