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

using namespace std;

ifstream f ("bfs.in");
ofstream g ("bfs.out");

const int N = 1e5 + 1;
vector <int> a[N];

int n, m, s, d[N];
queue <int> q;

void citire ()
{
    int i;
    f >> n >> m >> s;
    for (i=0; i<m; i++)
    {
        int x, y;
        f >> x >> y;
        a[x].push_back(y);
    }
    f.close();
}
void BFS()
{
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        for (auto y: a[x])
        {
            if (d[y] == -1)
            {
                q.push(y);
                d[y] = 1 + d[x];
            }
        }
    }
}
int main()
{
    int i;
    citire();
    for (i=1; i<=n; i++)
        d[i] = -1;
    q.push(s);
    d[s] = 0;
    BFS();
    for (i=1; i<=n; i++)
        g << d[i] << " ";
    return 0;
}