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

vector<int> graf[100005];
int viz[100005], bas[100005];

void bfs(int nod)
{
    queue<int> q;
    q.push(nod);
    viz[nod] = 1;
    bas[nod] = 0;
    while (!q.empty())
    {
        nod = q.front();
        q.pop();
        for (auto i : graf[nod])
        {
            if (viz[i] == 0)
            {
                viz[i] = 1;
                q.push(i);
                bas[i] = bas[nod] + 1;
            }
        }
    }
}
int main() 
{
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int n, m, s; cin >> n >> m >> s;
    for (int i = 1; i <= n; i ++)
    {
        bas[i] = -1;
    }
    for (int i = 1; i <= m; i ++)
    {
        int a, b; cin >> a >> b;
        graf[a].push_back(b);
    }
    bfs(s);
    for (int i = 1; i <= n; i ++)
    {
        cout << bas[i] << ' ';
    }
}