#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> v[100005];
queue <int> q;
int x,y,n,m,st;
int d[100005];
int bfs(int s)
{
    q.push(s);
    d[s]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i:v[nod])
            if(!d[i]) {q.push(i);
        d[i]=d[nod]+1;}
    }
}
int main()
{
    in>>n>>m>>st;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    bfs(st);
    for(int i=1;i<=n;i++)
    out<<d[i]-1<<" ";
    return 0;
}