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

using namespace std;

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

const int MAX = 1e5 + 1;
vector<int> adj[MAX];
queue<int> q;

int n, m, d[MAX], s;

void bfs(int nod)
{
    for(int i = 1; i <= n; ++i)
    {
        d[i] = -1;
    }

    d[nod] = 0;
    q.push(nod);

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

        for(int i = 0; i < adj[nod].size(); ++i)
        {
            int fiu = adj[nod][i];
            if(d[fiu] == -1)
            {
                d[fiu] = 1 + d[nod];
                q.push(fiu);
            }
        }
    }
}
int main()
{
    cin >> n >> m >> s;

    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
    }

    bfs(s);

    for(int i = 1; i <= n; ++i)
    {
        cout << d[i] << ' ';
    }

    return 0;
}