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

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

vector <int> G[100005];
bool v[100005];
int d[100005];
queue <int> q;
void bfs(int s)
{
    q.push(s);
    d[s] = 0;
    int nod, vecin;
    while (!q.empty())
    {
        nod = q.front();
        q.pop();

        for (unsigned int i=0; i<G[nod].size(); i++)
        {
            vecin = G[nod][i];
            if (d[vecin] == -1)
            {
                q.push(vecin);
                d[vecin] = d[nod] + 1;
            }
        }
    }
}
int main()
{
    int n, m, s;
    fin >> n >> m >> s;
    for (int i=0; i<m; i++)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }

    for (int i=1; i<=n; i++)
        d[i] = -1;

    d[s] = 0;
    bfs(s);
    for (int i=1; i<=n; i++)
        fout << d[i] << " ";
    return 0;
}