#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N=1000001;
vector <int> a[N];
int n,x0;
queue <int> q;
int d[N];
void afisare()
{
    for(int i=1;i<=n;i++)
        out<<d[i]<<' ';
}
void bfs(int x0)
{
    int x,y;
    q.push(x0);
    d[x0]=0;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(size_t i=0;i<a[x].size();i++)
        {
            y=a[x][i];
            if(d[y]==-1)
            {
                q.push(y);
                d[y]=d[x]+1;
            }
        }
    }
}
void citire()
{
    int m,x,y;
    in>>n>>m>>x0;
    for(int i=0;i<m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        d[i]=-1;
    }
}
int main()
{
    citire();
    bfs(x0);
    afisare();
    return 0;
}