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

using namespace std;


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


const int N = 1e5;
int n, m, s;
bool viz[N+1];
int dist[N+1];
vector < vector <int> > v;
queue <int> q;


void bfs(int ns)
{
    q.push(ns);
    viz[ns] = 1;

    while (!q.empty())
    {
        int nod = q.front();
        q.pop();

        for (int i = 0; i < v[nod].size(); i++)
        {
            int vec = v[nod][i];
            if (!viz[vec])
            {
                dist[vec] = dist[nod] + 1;
                viz[vec] = 1;
                q.push(vec);
            }
        }
    }
}


int main()
{
    fin >> n >> m >> s;

    v.resize(n+1);

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


    bfs(s);

    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
            fout << "-1 ";
        else
            fout << dist[i] << ' ';
    }


    return 0;
}