#include <fstream>
#include <bitset>
#include <queue>

using namespace std;

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

const int nMax = 100000 + 10;

int n, m, s;

vector < int > l[nMax];
queue < int > q;
bitset < nMax > viz;
int dist[nMax];

void Bfs(int node)
{
    q.push(node);
    viz[node]  = 1;
    dist[node] = 0;

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

        for (int nextNode : l[node])
        {
            if (!viz[nextNode])
            {
                viz[nextNode] = 1;
                dist[nextNode] = dist[node] + 1;
                q.push(nextNode);
            }
        }
    }
}

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

    for (int i = 1; i <= m; i++)
    {
        int a, b;

        fin >> a >> b;

        l[a].push_back(b);
    }

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

    fin.close();
    fout.close();
    return 0;
}