# include <bits/stdc++.h>

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

int n, m, s;
bool vis[100005];
int dmin[100005];

queue<int> Q;

vector<int> L[100005];

void read()
{
    int x, y;
    in >> n >> m >> s;
    for (int i = 1; i <= m; i++)
    {
        in >> x >> y;
        L[x].push_back(y);
    }
}

void bfs()
{
    int nod;
    Q.push(s);
    dmin[s] = 0;
    while (!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        for (int i = 0; i < L[nod].size(); i++)
        {
            if (dmin[L[nod][i]] == 1e9)
            {
                dmin[L[nod][i]] = dmin[nod] + 1;
                Q.push(L[nod][i]);
            }
        }
    }
}

int main()
{
    read();
    for (int i = 1; i <= n; i++)
        dmin[i] = 1e9;

    bfs();
    for (int i = 1; i <= n; i++)
        if (dmin[i] != 1e9)
            out << dmin[i] << " ";
        else out << -1 << " ";

    return 0;
}