#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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


int main()
{
    int n, m, s;
    in >> n >> m >> s;

    vector<vector<int>> A(n+1,vector<int>());

    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;

        A[x].push_back(y);
    }

    vector<int> drum(n+1);
    vector<bool> uz(n+1);

    queue<int> q({s});

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

        uz[nod] = true;

        for(auto it: A[nod])
            if(!uz[it])
            {
                uz[it] = true;
                drum[it] = drum[nod]+1;
                q.push(it);
            }
    }

    for(int i = 1; i <= n; i++)
        out << (drum[i] == 0 ? (i == s ? 0 : -1) : drum[i]) << ' ';

    return 0;
}