#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
queue <int> q;
int d[100003];
vector <int> v[100003];
void bfs()
{
    int nod,vecin;
    while (!q.empty())
    {
        nod=q.front();
        q.pop();
        for (int i=0;i<v[nod].size();i++)
        {
            if (d[v[nod][i]]==-1)
            {
                q.push(v[nod][i]);
                d[v[nod][i]]=d[nod]+1;
            }
        }
    }
}
int n,m,x;
int main()
{
    fin>>n>>m>>x;
    while (m--)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
    for (int i=1;i<=n;i++)
    {
        d[i]=-1;
        sort(v[i].begin(),v[i].end());
    }
    q.push(x);
    d[x]=0;
    bfs();
    for (int i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}