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

using namespace std;
int n, s, m;
int dist[10000], apare[1000];
queue <int> coada;
vector <int> lista[1000];

void bfs(int start)
{
    apare[start] = 1;
    coada.push(start);
    while(!coada.empty())
    {
        int nod = coada.front();
        coada.pop();
        for(int j=1; j<=lista[nod].size(); j++)
        {
            if(apare[j] == 0)
            {
                dist[j] = dist[nod] + 1;
                coada.push(j);
                apare[j] = 1;
            }
        }
    }
}

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

    fin>>n>>m>>s;

    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin>>x>>y;
        lista[x].push_back(y);
    }

    for(int i=1; i<=n; i++)
    {
        dist[i] = -1;
    }

    dist[s]=0;
    bfs(s);

    for(int i=1; i<=n; i++)
    {
        fout<<dist[i]<<" ";
    }
    return 0;
}