#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100005
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> graf[NMAX];
int n, m, start, dist[NMAX];
queue <int> coada;
void bfs()
{
    int nod, vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for (unsigned int i=0; i<graf[nod].size(); ++i)
        {
            vecin=graf[nod][i];
            if (dist[vecin]==-1)
            {
                coada.push(vecin);
                dist[vecin]=dist[nod]+1;
            }
        }

    }
}
void read()
{
    in >> n >> m >> start;
    for (int i=1; i<=m; ++i)
    {
        int x, y;
        in >> x >> y;
        graf[x].push_back(y);
    }
    for (int i=1; i<=n; ++i)
        dist[i]=-1;
    dist[start]=0;
    coada.push(start);
    bfs();
    for (int i=1; i<=n; ++i)
        out << dist[i] << " ";
}
int main()
{
    read();
    return 0;
}