#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

const int nmax = 100000;

vector <int> v[nmax+5];
queue <int> q;
int dist[nmax+5];

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int n, m, s;
    scanf("%d%d%d", &n, &m, &s);
    for(int i=0; i<m; i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        v[a].push_back(b);
    }
    dist[s] = 1;
    q.push(s);
    while(!q.empty())
    {
        int temp = q.front();
        q.pop();
        for(int i=0; i<v[temp].size(); i++)
            if(!dist[v[temp][i]])
            {
                dist[v[temp][i]] = dist[temp] + 1;
                q.push(v[temp][i]);
            }
    }
    for(int i=1; i<=n; i++)
        printf("%d ", dist[i] - 1);
    return 0;
}