#include <cstdio>
#include <vector>
#include <queue>
#define nmax 100005

using namespace std;

vector<int> g[nmax];
queue<int> q;
int n,m,s;
int viz[nmax];

void citire()
{
    int a,b;
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
    }
}

void bfs()
{
    int k;
    viz[s]=1;
    q.push(s);
    while(!q.empty())
    {
        k=q.front();
        q.pop();
        for(vector<int>::iterator ii=g[k].begin();ii!=g[k].end();++ii)
            if(viz[*ii]==0)
            {
                q.push(*ii);
                viz[*ii]=viz[k]+1;
            }
    }
}

void afisare()
{
    for(int i=1;i<=n;i++)
        printf("%d ",viz[i]-1);
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    bfs();
    afisare();
    return 0;
}