#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> v[100001];
int dist[100001];
void bfs(int node)
{
    queue<int> Q;
    dist[node]=1;
    Q.push(node);
    while(!Q.empty())
    {
        node=Q.front();
        Q.pop();
        for(auto it:v[node])
        {
            if(dist[it]==0)
            {
                dist[it]=dist[node]+1;
                Q.push(it);
            }
        }
    }
}
int main()
{
    int n,m,s,x,y;
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
    {
        fout<<dist[i]-1<<' ';
    }
    return 0;
}