#include <iostream>
#include <fstream>
#include <queue>
#define dim 100005

using namespace std;

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

int seen[dim] , xx , x , y , s, l,i , n ,m;
vector < int > v[dim];

void bfs()
{
    queue < int > Q;
    Q.push(s);
    seen[s] = 1;

    while(not Q.empty())
    {
        x = Q.front();
        Q.pop();
        int l = v[x].size();
        for(i = 0;i < l;i++)
        {
            xx = v[x][i];
            if(not seen[xx])
                seen[xx] = seen[x] + 1, Q.push(xx);
        }
    }
}

int main()
{
    f >> n >> m >> s;

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

    bfs();

    for(i = 1;i <= n;i++)
        g << seen[i] - 1 << " ";
    return 0;
}