#include <bits/stdc++.h>

using namespace std;
ifstream in ("bfs.in");
ofstream out ("bfs.out");
const int NMAX=100005;
int n,m,s;
vector <int> v[NMAX];
int x,y;
queue <int> q;
int dist[NMAX];
void bfs()
{
    q.push(s);
    dist[s]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto i:v[nod])
        {
            if(!dist[i])
            {
                dist[i]=dist[nod]+1;
                q.push(i);
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        out<<dist[i]-1<<" ";
    }
}
int main()
{
    in>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    bfs();
    return 0;
}