#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int> g[100010];
queue <int> q;

int n,m,start,d[100010];

void bfs()
{
    int nod,i;
    while (!q.empty())
    {
        nod=q.front(); ///back?
        q.pop();
        for (i=0;i<g[nod].size();i++)
            if (d[g[nod][i]]==-1)
            {
                q.push(g[nod][i]);
                d[g[nod][i]]=d[nod]+1;
            }
    }
}

int main()
{
    int i,j,x,y;
    fin>>n>>m>>start;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        d[i]=-1;
    d[start]=0;
    q.push(start);
    bfs();
    for (i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}