#include <bits/stdc++.h>

using namespace std;

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

int n,m,x0;
vector<int>a[100005];
int d[100005];

void citire()
{
    in >> n >> m >> x0;
    for (int i = 1; i <= m; i++)
    {
        int x,y;
        in >> x >> y;
        a[x].push_back(y);
    }
}

queue<int>q;

void BFS()
{
    d[x0] = 0;
    q.push(x0);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int i = 0; i < a[nod].size(); i++)
        {
            int vecin = a[nod][i];
            if(d[vecin] == -1)
            {
                d[vecin] = d[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main()
{
    citire();
    for(int i = 1; i <= n; i++)
        d[i] = -1;
    BFS();
    for (int i = 1; i <= n; i++)
        out << d[i] << " ";
    return 0;
}