#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");
    int N, M, S, x, y;
    f >> N >> M >> S;
    for (int i = 1; i <= M; i++)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    q.push(S);
    while(!q.empty())
    {
        int a = q.front();
        q.pop();
        for (int i = 0; i < v[a].size(); i++)
        {
            if(d[v[a][i]] == 0 && v[a][i] != a)
            {
                d[v[a][i]] = d[a] + 1;
                q.push(v[a][i]);
            }
        }
    }
    for (int i = 1; i <= N; i++)
    {
        if(i == S) g << "0 ";
        else if(d[i] == 0) g << "-1 ";
        else g << d[i] << " ";
    }
    return 0;
}