#include <cstdio>
#include <queue>

using namespace std;

queue <int> q;
vector <int> g[100005];

int n, m, s, x, y;
int pasi[100005];

void bfs()
{
    q.push(s);
    pasi[s]=1;
    while(!q.empty())
    {
        int node=q.front();
        q.pop();
        for(auto &v:g[node])
        {
            if(pasi[v] == 0)
            {
                q.push(v);
                pasi[v]=pasi[node]+1;
            }
        }
    }
}

int main()
{

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

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

    for(int i=1; i<=m; i++)
    {
        scanf("%d %d", &x, &y);
        g[x].push_back(y);
    }
    bfs();
    for(int i=1; i<=n; i++)
        printf("%d ", pasi[i]-1);
    return 0;
}