#include <iostream>
#include <queue>
#include <fstream>
#include <vector>
#define mx 100005


using namespace std;
int n,y,m,x,s;
int p[mx],c[mx],viz[mx];

vector<int> v[mx];
queue<int> q;

void bfs(int nod)
{
    q.push(nod);
    viz[nod]=1;
    p[nod]=0;
    while (q.size()>0)
    {
        nod=q.front();
        for (int i=0; i<v[nod].size(); i++)
        {
            if(viz[v[nod][i]]==0)
            {
                viz[v[nod][i]]=1;
                p[v[nod][i]]=p[nod]+1;
                q.push(v[nod][i]);
            }
        }
        q.pop();
    }
}

int main()
{

 ifstream f("bfs.in");
 ofstream g("bfs.out");

 f>>n>>m>>s;
 for(int i=1; i<=m; i++)
 {
     f>>x>>y;
     v[x].push_back(y);
 }

 for (int i=1; i<=n; i++)
    p[i]=-1;

 bfs(s);

 for (int i=1; i<=n; i++)
 {
     g<<p[i]<<" ";
 }



 return 0;
}