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

queue <int> q;
vector<int>v[100001];
bool viz[100001];
int d[100001],x,y,n,m,S;
void bfs(int k)
{
    viz[k]=1;
    d[k]=0;
    q.push(k);
    while(!q.empty())
    {
        int x=q.front();
        for(int i=0; i<v[x].size(); ++i)
            if(!viz[v[x][i]])
            {
                q.push(v[x][i]);
                viz[v[x][i]]=1;
                d[v[x][i]]=d[x]+1;
            }
            q.pop();
    }
}
int main()
{
    f>>n>>m>>S;
    for(int i=1; i<=n; ++i)
        d[i]=-1;
    for(int i=1; i<=m; ++i)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    bfs(S);
    for(int i=1;i<=n;++i)
        g<<d[i]<<" ";
    return 0;
}