#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100001
using namespace std;

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

int m,n,nod;
vector <int> v[NMAX];
int viz[NMAX];

void BFS(int nod)
{
    viz[nod] = 0;
    queue <int > Q;
    Q.push(nod);
    while(!Q.empty())
    {
        int x = Q.front();
        Q.pop();
        for(int i = 0 ; i < v[x].size(); ++i)
            if(viz[v[x][i]] == -1)
            {
                viz[v[x][i]] = viz[x] + 1;
                Q.push(v[x][i]);
            }
    }
}
int main()
{
    f >> n >> m >> nod;
    for(int i = 1; i <= n; ++i)
        viz[i] = -1;
    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
    }
    BFS(nod);

    for(int i = 1; i <= n; ++i)
        g << viz[i] << ' ';
    f.close();
    g.close();
    return 0;
}