#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n,m,a;
vector <int> v[100005];
queue <int> q;
int dist[100005];

void citire()
{
    fin>>n>>m>>a;
    int x,y;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        ///v[y].push_back(x);
    }
}

void bfs()
{
    dist[a]=1;
    q.push(a);
    while(q.empty()==0)
    {
        int nod=q.front();
        for(auto k:v[nod])
        {
            if(dist[k]==0)
            {
                q.push(k);
                dist[k]=dist[nod]+1;
            }
        }
        q.pop();
    }
}

int main()
{
    citire();
    bfs();
    for(int i=1; i<=n; i++)
        fout<<dist[i]-1<<" ";
    return 0;
}