#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int maxn = 100005;
vector <int> v[maxn];  /// v[i] = vecinii nodului i
int dist[maxn];
queue <int> q;
int main()
{
    int n, m, s;
    in >> n >> m >> s;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        v[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        dist[i] = 100000000;
    dist[s] = 0;

    q.push(s);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int i = 0; i < v[nod].size(); i++)
        {
            int vecin = v[nod][i];
            if(dist[vecin] > dist[nod] + 1)
            {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
    for(int i = 1; i <= n; i++)
    {
        if(dist[i] == 100000000)
            out << "-1 ";
        else
            out << dist[i] << " ";
    }
    return 0;
}