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

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

vector<int> L[100005];
int viz[100005] , n , m , p , d[100005];

void BFS(int k)
{
    for(int i = 1;i <= n;i++)
        d[i] = -1;
    d[k] = 0;
    queue<int> q;
    q.push(k);
    viz[k] = 1;
    while(!q.empty())
    {
        k = q.front();
        q.pop();
        for(int i : L[k])
            if(viz[i] == 0)
            {
                q.push(i);
                viz[i] = 1;
                d[i] = d[k] + 1;
            }
    }
}

int main()
{
    int i , j , k;
    fin >> n >> m >> p;
    for(k = 1;k <= m;k++)
    {
        fin >> i >> j;
        L[i].push_back(j);
    }
    BFS(p);
    for(i = 1;i <= n;i++)
        fout << d[i] << " ";
    return 0;
}