#include <iostream>
#include <fstream>
#include <cstring>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
#define MAX 100005
int dist[MAX];
typedef vector<int> :: iterator iter;
vector<int> G[MAX];
int n, m, s, x, y, nod, i   ;
queue <int> Q;

int main()
{
    fin>>n>>m>>s;
    while(m--)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    dist[s]=1;
    Q.push(s);
    while(Q.size())
    {
        nod=Q.front();
        Q.pop();
        for(iter it=G[nod].begin();it!=G[nod].end();it++)
        {
            if(!dist[*it])
            {
                dist[*it]=dist[nod]+1;
                Q.push(*it);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        fout<<dist[i]-1<<" ";
    }
}