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

using namespace std;

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

const int Max = 100010;

vector<int> v[Max];
int d[Max];
char vaz[Max];

void bfs(int nod)
{
    queue<int> q;
    q.push(nod);
    vaz[nod] = 1;
    d[nod] = 0;

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int i = 0; i < v[nod].size(); ++i)
        {
            if(!vaz[v[nod][i]])
            {
                d[v[nod][i]] = d[nod] + 1;
                vaz[v[nod][i]] = 1;
                q.push(v[nod][i]);
            }
        }
    }
}

int main()
{
    int n, m, nod, x, y;
    in >> n >> m >> nod;
    for(int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        v[x].push_back(y);
    }

    bfs(nod);

    for(int i = 1; i <= n; ++i)
    {
        if(!vaz[i])
            out  << "-1 ";
        else
            out << d[i] << " ";
    }
    return 0;
}