#include <queue>
#include <vector>
#include <fstream>
#define nmax 100002

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> victor[100002];

int x,y,viz[100002],nc,c[100002],pasi[100002],n,m,s;

void bfs (int nod)
{
    int p,u,i,v,j;
    p=u=1;
    pasi[nod]=0;
    viz[nod]=1;
    c[p]=nod;
    while(p<=u)
    {
        v=c[p++];
        for(j=0;j<victor[v].size();++j)
        {
            i=victor[v][j];
            if(!viz[i])
            {
                c[++u]=i;
                viz[i]=1;
                pasi[i]=pasi[v]+1;
            }
        }
    }
}

int main ()
{
    int i;

    fin>>n>>m>>s;
    for(i=1;i<=n;++i)
        pasi[i]=-1;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y;
        victor[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;++i)
        fout<<pasi[i]<<' ';
    return 0;
}