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

using namespace std;

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

const int nmax = 100005;
//int mat[nmax][nmax];
queue <int> coada;
vector<int> vecin[nmax];
int viz[nmax], n;

void bfs(int inc)
{
    viz[inc] = 1;
    coada.push(inc);
    
    while (!coada.empty())
    {
        int x = coada.front();
        coada.pop();
        for (int i = 0; i < vecin[x].size(); i++)
        {
            int y = vecin[x][i];
            if (!viz[y])
            {
                viz[y] = viz[x] + 1;
                coada.push(y);
            }
        }
    }
}

int main()
{
    int m, x, y, s;
    f >> n >> m >> s;
    for (int i = 1; i <= m; i++)
    {
        f >> x >> y;
        vecin[x].push_back(y);
    }
    
    bfs(s);
    for (int i = 1; i <= n; i++)
        g << viz[i] - 1 << ' ';
    
    return 0;
}