#include<fstream>
#include<queue>
#include<vector>
#include<cstring>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int>L[100001];
int sol[100001],nod,n,m,niv;
bool viz[100001];
queue<int>q;
void citire()
{   int i,x,y;
    f>>n>>m>>nod;
    for(i=1;i<=m;i++)
     {
        f>>x>>y;
        L[x].push_back(y);
     }
}
void bfs(int i)
{  int nodcur,j;
     q.push(i);
    memset(sol,-1,sizeof(sol));
    viz[i]=true;niv=0;sol[i]=0;
    while(!q.empty())
    {
        nodcur=q.front();
        q.pop();
        for(j=0;j<L[nodcur].size();j++)
            if(viz[L[nodcur][j]]==false)
            {
                q.push(L[nodcur][j]);
                sol[L[nodcur][j]]=sol[nodcur]+1;
                viz[L[nodcur][j]]=true;
            }
    }
}
void afisare()
{
    for(int i=1;i<=n;i++)g<<sol[i]<<" ";
}
int main()
{
    citire();
    bfs(nod);
    afisare();
    return 0;
}