#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, i, j, s, x, y;
vector <vector <int>> v;
vector <int> viz;
int main()
{
    fin >> n >> m >> s; v.resize(n+1); viz.resize(n+1);
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    queue <int> q;
    q.push(s);
    viz[s] = 1;
    while (!q.empty())
    {
        s = q.front();
        q.pop();
        for (i = 0; i < v[s].size(); i++)
        {
            x = v[s][i];
            if (viz[x] == 0)
            {
                viz[x] = viz[s]+1;
                q.push(x);
            }
        }
    }
    for (i = 1; i <= n; i++)
    {
        fout << viz[i]-1 << " ";
    }
    return 0;
}