#include<bits/stdc++.h>
using namespace std;
vector<int> v[100005];
vector<int>::iterator it;
deque<int> q;
int n,m,s,seen[100005],x,y;
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    seen[s]=1;
    q.push_back(s);
    while(!q.empty())
    {
        x=q.front();
        for(vector<int>::iterator it=v[x].begin();it!=v[x].end();it++)
        {
            if(!seen[*it])
            {
                seen[*it]=seen[x]+1;
                q.push_back(*it);
            }
        }
        q.pop_front();
    }
    for(int i=1;i<=n;i++)
    {
        printf("%d ",seen[i]-1);
    }
    return 0;
}