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

using namespace std;

vector <int> g[100005];
queue <int> q;
int l[100005];
int n, m, s;

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

    }
}

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

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

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

    return 0;
}