#include <bits/stdc++.h>

using namespace std;

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

const int maxn = 1e5 + 5;

queue <int> q;
int d[maxn];
vector <int> v[maxn];

int main()  {
    int n, m, s;
    fin >> n >> m >> s;
    for(int i = 1;i <= m;i++)  {
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
    q.push(s);
    memset(d, 0x3f3f3f3f, sizeof d);
    d[s] = 0;
    while(!q.empty())  {
        int nod = q.front();
        q.pop();
        for(auto x : v[nod])  {
            if(d[x] > d[nod] + 1)  {
                d[x] = d[nod] + 1;
                q.push(x);
            }
        }
    }
    for(int i = 1;i <= n;i++)  {
        if(d[i] != 0x3f3f3f3f)
            fout << d[i] << " ";
        else
            fout << "-1 ";
    }
    return 0;
}