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

#define NMAX 100005

using namespace std;

int n, m, s;
vector<int> G[NMAX];
queue<int> q;
int viz[NMAX];

void solve(int start)
{
    q.push(start);
    viz[start] = 1;
    while(!q.empty())
    {
        vector<int>::iterator it;
        int elem = q.front();
        q.pop();
        for (it=G[elem].begin(); it!=G[elem].end(); it++)
        {
            if (viz[*it] == 0)
            {
                viz[*it] = viz[elem] + 1;
                q.push(*it);
            }
        }

    }

   for (int i=1; i<=n; i++)
       printf("%d ", viz[i] -1);
}

void read()
{
    int x, y;
    scanf("%d %d %d\n", &n, &m, &s);
    for (int i=0; i<m; i++)
    {
        scanf("%d %d\n", &x, &y);
        G[x].push_back(y);
    }
}
int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    read();
    solve(s);
    return 0;
}