#include <bits/stdc++.h>
using namespace std;

ifstream in ("bfs.in");
ofstream out ("bfs.out");
int dist[100005];

int n, m, s, x, y;
vector<int>a[100005];

void  bfs()
{
    queue<int>q;
    int nod,vecin;
    q.push(s);
    dist[s] = 0;
    while(q.empty() == false)
    {
        nod = q.front();
        q.pop();
        for(int i = 0; i < a[nod].size(); i++)
        {
            vecin = a[nod][i];
            if(dist[vecin] == -1)
            {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main()
{

    in >> n >> m >> s;

    for(int i = 1; i <= m; i++)
    {
        in >> x >> y;

        a[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
    {
        dist[i] = -1;
    }
    bfs();

    for(int i = 1; i <= n; i++)
    {
        out << dist[i] << " ";
    }


    return 0;
}