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

using namespace std;

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

int n, m, s, x, y, viz[100001], d[100001];
vector<int> G[100001];
queue<int> q;


int main()
{
    fin >> n >> m >> s;
    d[s] = 0;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    q.push(s);
    while(!q.empty())
    {
        viz[s] = 1;
        int nod = q.front();
        q.pop();
        for(int i = 0; i < G[nod].size(); i++)
        {
            if(viz[G[nod][i]] == 0)
            {
                q.push(G[nod][i]);
                viz[G[nod][i]] = 1;
                d[G[nod][i]] = d[nod] + 1;
            }
        }
    }
    for(int i = 1; i <= n; i++)
    {
        if(d[i] != 0)
            fout << d[i] << " ";
        else if(i == s)
            fout << d[s] << " ";
        else fout << "-1 ";
    }

    return 0;
}