#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;

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

int main()
{
    int n,m,s;
    int x,y,i,top,lim;
    int cost[100100];
    int viz[100100];

    f>>n>>m>>s;

    vector <int> graf[n];

    for(i = 0;i < m; i++)
    {
        f>>x>>y;
        graf[x].push_back(y);
    }

    for(i = 1;i <= n;i++)
        cost[i] = -1;

    queue <int> C;
    C.push(s);
    viz[s]=1;
    cost[s]=0;
    while(C.empty()==false)
    {
        top = C.front();
        C.pop();
        lim = graf[top].size();

        for(i = 0; i < lim; i++)
        {
            if(viz[graf[top][i]] == 0)
            {
                viz[graf[top][i]] = 1;
                cost[graf[top][i]] = cost[top]+1;
                C.push(graf[top][i]);
            }
        }
    }
    for(i = 1;i <= n; i++)
        g<<cost[i]<<" ";
    return 0;
}