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