#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
int n, m, s, x, y;
vector <int> a[100000];
queue <int> q;
int d[100000];
void bfs(int s)
{
    d[s]=1;
    q.push(s);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(int i=0; i<a[x].size(); ++i)
            if(d[a[x][i]]==0)
            {
                q.push(a[x][i]);
                d[a[x][i]]=d[x]+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);
        a[x].push_back(y);
    }
    bfs(s);
    for(int i=1; i<=n; i++)
        printf("%d ", d[i]-1);
    return 0;
}