#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,i,x,y,d[100009],nod;
vector <int> v[100009];
queue <int> q;
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].pb(y);
    }
    memset(d,-1,sizeof(d));
    q.push(s);
    d[s]=0;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();i++)
        {
            if(d[v[nod][i]]==-1||d[v[nod][i]]>d[nod]+1)
            {
                d[v[nod][i]]=d[nod]+1;
                q.push(v[nod][i]);
            }
        }
    }
    for(i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}