#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define NMAX 100002
using namespace std;

vector<int> adj[NMAX];
queue<int>q;
int d[NMAX];
bool viz[NMAX];

void bfs(int nod)
{
    viz[nod]=true;
    d[nod]=0;
    q.push(nod);
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(vector<int>::iterator it=adj[u].begin();it!=adj[u].end();it++)
            if(!viz[*it])
            {
                viz[*it]=true;
                d[*it]=d[u]+1;
                q.push(*it);
            }
    }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,s,x,y;
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        adj[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
        if(viz[i])
            cout<<d[i]<<' ';
        else
            cout<<"-1 ";
    return 0;

}