#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
vector <int> v[100010];
pair<int,int> elem;
queue<pair<int,int> > q;
int n, m, start, viz[100010], f[100010];
void citire ()
{
    int i, x, y;
    fin>>n>>m>>start;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for (i=1; i<=n; i++) f[i]=-1;
}
void bfs (int vf)
{
    int i;
    f[vf]=q.front().second;
    q.pop();
    for (i=0; i<v[vf].size(); i++)
    {
        if (viz[v[vf][i]]==0)
        {
            viz[v[vf][i]]=1;
            elem.first=v[vf][i];
            elem.second=f[vf]+1;
            q.push(elem);
        }
    }
    if (!q.empty()) bfs(q.front().first);
}
int main ()
{
    citire();
    elem.first=start;
    elem.second=0;
    q.push(elem);
    viz[start]=1;
    bfs(q.front().first);
    for (int i=1; i<=n; i++) fout<<f[i]<<' ';
}