#include <bits/stdc++.h>
using namespace std;
const int N=1e6;
vector<int> graph[N]; int n,m,s,dist[N];bool visited[N];
void bfs(int x)
{
    queue<int> q;
    visited[x]=1;
    dist[x]=0;
    q.push(x);
    while(!q.empty())
    {
        int s=q.front(); q.pop();
        for(auto u: graph[s])
        {
            if(visited[u]) continue;
            visited[u]=1;
            dist[u]=dist[s]+1;
            q.push(u);
        }
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    cin>>n>>m>>s;int x,y;
    while(m--)
    {
        cin>>x>>y;
        graph[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
    {
        if(!visited[i])cout<<"-1 ";
        else cout<<dist[i]<<" ";
    }
    return 0;
}