#include<fstream>
#include<vector>
#include<cstring>
#include<queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int a,b,s,i,n,m,x,d[100100];
vector<int>l[100100];
queue<int>q;
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;++i)
    {
        f>>a>>b;
        l[a].push_back(b);
    }
    memset(d,-1,sizeof(d));
    d[s]=0;
    q.push(s);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(vector<int>::iterator it=l[x].begin();it!=l[x].end();++it)
        if(d[*it]==-1)
        {
            d[*it]=d[x]+1;
            q.push(*it);
        }
    }
    for(i=1;i<=n;++i)
    g<<d[i]<<' ';
    g<<'\n';
    return 0;
}