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

using namespace std;
vector <int> a[100001];
queue <int> q;

int i, j, m, n, o, x, y, viz[100001], d[100001];
void bfs(int nod)
{
    int v;
    vector <int>::iterator it;
    q.push(nod);
    viz[nod]=1;

    while(!q.empty())
    {
        v=q.front();
        q.pop();
        for(it=a[v].begin(); it!=a[v].end(); ++it)
        if(!viz[*it])
        {
            q.push(*it);
            d[*it]=d[v]+1;
            viz[*it]=1;
        }
    }
}
int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d%d%d", &n, &m, &o);
    for(i=1; i<=m; ++i)
    {
        scanf("%d%d", &x, &y);
        a[x].push_back(y);
    }

    bfs(o);

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

    return 0;
}