#include <cstdio>
#include <vector>

using namespace std;

const int MAX = 100003;

vector<int> v[MAX];
int dist[MAX], n, m;

void dfs(int node);

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int s, a, b;
    scanf("%d%d%d", &n, &m, &s);
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d", &a, &b);
        v[a].push_back(b);
    }
    for(int i=1; i<=n; i++)
        dist[i] = -1;
    dist[s] = 0;
    dfs(s);
    for(int i=1; i<=n; i++)
        printf("%d ", dist[i]);
    return 0;
}
void dfs(int node)
{
    vector<int>::iterator it;
    for(it=v[node].begin(); it!=v[node].end(); ++it)
        if(dist[*it] == -1 or dist[*it] > dist[node] + 1){
            dist[*it] = dist[node] + 1;
            dfs(*it);
        }
}