#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int N=100005;
vector<int> adj[N];
int dist[N],viz[N];

void BFS(int start)
{
    queue<int> Q;
    Q.push(start);
    viz[start]=1;
    dist[start]=0;
    while(!Q.empty())
    {
        int u=Q.front();
        Q.pop();
        for(int v : adj[u])
            if(viz[v]==0)
            {
                Q.push(v);
                dist[v]=dist[u]+1;
                viz[v]=1;
            }
    }
}
int main()
{
    int n,m,s;
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        adj[x].push_back(y);
    }
    BFS(s);
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
            fout<<-1<<" ";
        else fout<<dist[i]<<" ";
    }
    return 0;
}