#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int N=1<<17;
int d[N],n,m,x,y,s,i;
vector <int> a[N];
queue <int> q;
void citire()
{
    fin>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
    q.push(s);
}
void initializare()
{
    for(i=0;i<N;i++)
    {
        d[i]=-1;
    }
}
void rezolvare()
{
    d[s]=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)
            {
                d[y]=1+d[x];
                q.push(y);
            }
        }
    }
}
void afisare()
{
    for(i=1;i<=n;i++)
        fout<<d[i]<<" ";
}
int main()
{
    citire();
    initializare();
    rezolvare();
    afisare();
    return 0;
}

/*#include <fstream>

using namespace std;
ifstream fin("BFS.in");
ofstream fout("BFS.out");
int a[101][101],viz[101];
int main()
{
    int xo,nod,j,n,m,x,coada[101];
    fin>>n>>m>>x;
    m=x=0;
    coada[m]=xo;
    viz[xo]=1;
    while(m<=x)
    {
        nod=coada[x];
        for(j=1; j<=n; j++)
            if(a[nod][j]==1 && viz[j]==1)
            {
                x++;
                coada[x]=j;
                viz[j]=1;
            }
        x++;
    }
    for(j=1;j<=x;j++)
        fout<<coada[j]<<" ";
    return 0;
}*/