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

std::ifstream f("bfs.in");
std::ofstream o("bfs.out");
int c[1000001];
void bfs(std::vector<int> lol[], int vv)
{
    std::queue<int> q;
    q.push(vv);
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        for(int i=0; i<lol[x].size(); i++)
        {
            if(c[lol[x][i]] == 0 && lol[x][i] != vv)
            {
                c[lol[x][i]]=c[x]+1;
                q.push(lol[x][i]);
            }
        }
    }
}
int main()
{
    int n, m, s;
    f >> n >> m >> s;
    std::vector<int> adj[10001];

    int x, y;
    for(int i = 0; i < m; i++)
    {
        f >> x >> y;
        if(x != y)
            adj[x].push_back(y);
    }
    bfs(adj, s);
    for(int i=1; i<=n; i++)
        if (i!=s&&c[i]==0)
            o<<-1<<' ';
        else
            o << c[i] << ' ';
}