#include <fstream>
#include <vector>
#include <queue>

#define pb push_back

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N = 1e5 + 5;

int n, m, s, ans[N];
bool vzt[N];
vector<int> g[N];
queue<int> que;

int main()
{
    in >> n >> m >> s;
    for(int i=1; i<=m; i++) {
        int x, y;
        in >> x >> y;
        g[x].pb(y);
    }

    que.push(s);
    vzt[s] = 1;
    while(!que.empty()) {
        int nod = que.front();
        que.pop();

        for(auto nxt : g[nod])
            if(!vzt[nxt]) {
                ans[nxt] = ans[nod] + 1;
                vzt[nxt] = 1;
                que.push(nxt);
            }
    }

    for(int i=1; i<=n; i++)
        if(i == s)
            out << "0 ";
        else if(ans[i])
            out << ans[i] << ' ';
        else out << "-1 ";
    return 0;
}