#include <bits/stdc++.h>

using namespace std;
vector<int>l[100005];
int d[100005];
queue<int>q;
void build_bfs(int nod)
{
    q.push(nod);
    d[nod]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(int i=0;i<l[x].size();i++)
            if(d[l[x][i]]==-1)
            {
                d[l[x][i]]=d[x]+1;
                q.push(l[x][i]);
            }
    }
}
int main()
{
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int n,m,a,b,nod;
    cin>>n>>m>>nod;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b;
        l[a].push_back(b);
    }
    memset(d,-1,sizeof(d));
    build_bfs(nod);
    for(int i=1;i<=n;i++)
        cout<<d[i]<<" ";
    return 0;
}