#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int NMAX = 100000 + 5;
queue <int> q;
vector <int> g[NMAX];
int n,m,start,niv[NMAX],x,y;
bool sel[NMAX];
inline void bfs(int x)
{
    niv[x] = 1;
    sel[x] = true;
    q.push(x);
    while(!q.empty())
    {
        int X = q.front();
        for (int i = 0 ; i<g[X].size(); ++i)
        {
            if (!sel[g[X][i]])
            {
                sel[g[X][i]] = true;
                niv[g[X][i]] = niv[X] + 1;
                q.push(g[X][i]);
            }
        }
        q.pop();
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d\n", &n, &m ,&start);
    for (int i = 1; i<=m; ++i)
    {
        scanf("%d %d", &x,&y);
        g[x].pb(y);
    }
    bfs(start);
    for (int i = 1; i<=n; ++i)
        printf("%d ", niv[i] - 1);
    return 0;
}