#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> v[100005];
queue <int> q;
int dist[100005];
int main()
{
    int n, m, s;
    in >> n >> m >> s;
    for(int i = 1; i <= m; i ++)
    {
        int a, b;
        in >> a >> b;
        v[a].push_back(b);
    }
    q.push(s);
   /// cout << '\n';
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        for(int i = 0; i < v[x].size(); i ++)
        {
            if(dist[v[x][i]] == 0 && v[x][i] != x)
            {
                dist[v[x][i]] = dist[x] + 1;
                q.push(v[x][i]);
                ///cout << x << " " << v[x][i] << '\n';
            }
        }
    }
    for(int i = 1; i <= n; i ++)
    {
        if(i == s)
            out << "0 ";
        else if(dist[i] == 0)
            out << "-1 ";
        else
            out << dist[i] << " ";
    }
    return 0;
}