#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n, m, s;
int x,y;

vector<int> bfs(vector<vector<int>> &lista, int start){
    vector<int> result(n+1, -1);
    vector<bool> viz(n+1, 0);
    queue <pair<int, int>> q;
    q.push({start,0});
    viz[start]=1;
    while(!q.empty())
    {
        auto p = q.front();
        q.pop();
        int node = p.first;
        int dist = p.second;
        result[node] = dist;
        for(int i=0; i<lista[node].size(); i++)
        {
            int vecin = lista[node][i];
            if(viz[vecin]==0)
            {
                viz[node] = 1;
                q.push({vecin, dist+1});
            }
        }
    }
    return result;
}
int main() {
    cin>>n>>m>>s;
    vector<int> v;
    vector<vector<int>> lista(n+1,v);
    for(int i=0; i<m; i++)
    {
        cin>>x>>y;
        lista[x].push_back(y);
    }
    vector<int> result = bfs(lista, s);
    for(int i=1; i<result.size(); i++)
        cout<<result[i]<<' ';
    return 0;
}