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

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<vector<int>> g;
vector<int>distanta;
void citire(int& n, int& m, int& s)
{
    fin >> n >> m >> s;
    distanta.resize(n+1, -1);
    g.resize(n+1);
    for(int i = 1; i< m; ++i)
    {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
    }
}


void bfs(int nod)
{
    queue<int> q;
    q.push(nod);
    distanta[nod] = 0;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        for(int& v : g[x])
        {
            if(distanta[v] == -1)
            {
                q.push(v);
                distanta[v] = distanta[x] + 1;
            }
        }
    }
}
int main()
{
    int n, m, s;
    citire(n, m, s);
    bfs(s);
    for(int i = 1; i <= n; ++i)
    {
        fout << distanta[i] << ' ';
    }
    return 0;
}