#include <vector>
#include <queue>
#include <cstdio>
using namespace std;

vector <int> v[100001];
bool f[100001];
int s[100001];
queue <int> q;
void bfs(int nod)
{
    f[nod]=1;
    q.push(nod);
    while (!q.empty()){
        nod=q.front();
        for (int i=0;i<v[nod].size();i++){
            if (f[v[nod][i]]==0){
                q.push(v[nod][i]);
                f[v[nod][i]]=1;
                s[v[nod][i]]=s[nod]+1;
            }
        }
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,x,y,i,start;
    scanf("%d%d%d", &n, &m, &start);
    for (i=0;i<m;i++){
        scanf("%d%d", &x, &y );
        v[x].push_back(y);
    }
    bfs(start);
    for (i=1;i<=n;i++){
        if (!f[i]) printf("-1 ");
        else {
            printf("%d ", s[i]);
        }
    }
    return 0;
}