#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <bitset>
#define MAX 100001
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
vector<int>adiacenta[100001];
queue<int>q;
int n,m,sursa,x,y;
int pasi[100001];
int main()
{
    for(int i = 1;i<=100000;i++)
        pasi[i] = -1;
    f >> n >> m >> sursa;
    for(int i = 1;i<=m;i++)
    {
        f >> x >> y;
        adiacenta[x].push_back(y);
    }
    q.push(sursa);
    pasi[sursa] = 0;
    while(!q.empty())
    {
        int curent = q.front();
        q.pop();
        for(auto &v:adiacenta[curent])
        {
            if(pasi[v]==-1)
            {
                pasi[v] = pasi[curent]+1;
                q.push(v);
            }
        }
    }
    for(int i = 1;i<=n;i++)
    {
        g << pasi[i]<< " ";
    }

}