#include <stdio.h>
#include <vector>
#include <utility>
#include <queue>
#include <map>

#define WHITE 1
#define GRAY  2
#define BLACK 3

std::map<int, int> visited;

void bfs(std::vector<std::pair<int, int> > &adj, int s)
{
    std::queue<int> q;

    q.push(s);
    visited[s] = 0;

    while (!q.empty())
    {
        int node = q.front();
        q.pop();

        for (int i = 0; i < adj.size(); i++)
        {
            std::pair<int, int> p = adj[i];
            if (p.first == node)
            {
                if (visited.find(p.second) == visited.end())
                {
                    q.push(p.second);
                    visited[p.second] = visited[p.first] + 1;
                }
            }
        }
    }
}

int main()
{
    int m, n, s, i;
    std::vector<std::pair<int, int> > adj;

    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d %d %d", &n, &m, &s);

    for (i = 0; i < m; i++)
    {
        int x, y;
        scanf("%d %d", &x, &y);
    
        adj.push_back(std::pair<int, int>(x, y));
    }

    bfs(adj, s);

    for (i = 1; i <= n; i++)
    {
        if (visited.find(i) != visited.end())
            printf("%d ", visited[i]);
        else 
            printf("-1 ");
    }

    return 0;
}