#include <cstring>
#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>
using namespace std;
vector<int> g[100100];
int d[100100];
void bfs(int s,int n)
{
    queue<int> q;
    q.push(s);
    d[s]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto i:g[x])
        {
            if(d[i]==0x3f3f3f3f)
            {
                d[i]=d[x]+1;
                q.push(i);
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(d[i]==0x3f3f3f3f)
            d[i]=-1;
        cout<<d[i]<<" ";
    }
    return;
}
int main()
{
    memset(d,0x3f,sizeof(d));
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,s,x,y;
    int i;
    cin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        a:
        cin>>x>>y;
        g[x].push_back(y);
        //g[y].push_back(x);
    }
    bfs(s,n);
    return 0;
}