#include <fstream>
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> v[100001];
int viz[100001];
int dist[100001];
queue <int> q;
int start;
int n;
int m;

void adaugareNod(int x, int y)
{
    v[x].push_back(y);
}

void citire()
{
    f >> n >> m >> start;

    int x, y;
    for(int i = 0; i < m; ++i)
    {
        f >> x >> y;
        adaugareNod(x, y);
    }
}


/*void afisare()
{
        for(int i = 1; i <= n; ++i, cout << "end \n")
            for(size_t j = 0; j < v[i].size(); ++j)
                cout << v[i][j] << " ";
}
*/

void bfs()
{
    for(int i = 0; i <=n; ++i) dist[i] = -1;

    q.push(start);
    viz[start] = 1;
    dist[start] = 0;

    while(!q.empty())
    {
        int curent = q.front();
        q.pop();;

        for(size_t i = 0; i < v[curent].size(); ++i)
        {
            int nod = v[curent][i];
            if(!viz[nod])
            {
                viz[nod] = 1;
                dist[nod] = dist[curent] + 1;
                q.push(nod);
            }
        }
    }

}

void afis()
{
    for(int i = 1; i <= n; ++i)
    {
        g << dist[i] << ' ';
    }


    g << '\n';
}

int main()
{

    citire();
   // afisare();
    bfs();
    afis();

    return 0;
}