#include <bits/stdc++.h>
#define longc 100005
using namespace std;
vector<int>G[longc];
queue<int > q;
int n,m,s,x,y,v[longc];

void read()
{
    scanf("%d%d%d",&n,&m,&s);
    for (int i=1; i<=m; ++i)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
}

void parcurgere()
{
    q.push(s);
    v[s]=1;
    while (!q.empty())
    {
        int pz=q.front();
        q.pop();
        for (vector <int> :: iterator it=G[pz].begin(); it!=G[pz].end() ; ++it)
        {
            if (!v[*it])
            {
                q.push(*it);
                v[*it]=v[pz]+1;
            }
        }
    }
    for (int i=1;i<=n ; ++i)
        printf("%d ",v[i]-1);
}

int main()
{

    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    read();
    parcurgere();


    return 0;
}