#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
const int NMAX=100005;
vector <int> v[NMAX];
int pasi[NMAX];
void bfs(int x)
{
    queue <int> q;
    int i,nod;
    q.push(x);
    pasi[x]=1; //+1 sa fie dif de 0, la sf scadem 1
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();i++)
        {
            if(pasi[v[nod][i]]==0)
            {
                q.push(v[nod][i]);
                pasi[v[nod][i]]=pasi[nod]+1;
            }
        }
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,s,i,x,y;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        sort(v[i].begin(),v[i].end());
    bfs(s);
    for(i=1;i<=n;i++)
        printf("%d ",pasi[i]-1);
    return 0;
}