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

using namespace std;

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

vector <int> bfs(vector <vector<int>> &graph,int s) {
    vector <int> viz(graph.size(),-1);
    queue <int> q;
    q.push(s);
    viz[s]=0;
    while (!q.empty()) {
        int node=q.front();
        q.pop();
        for (int i=0;i<graph[node].size();i++) {
            if (viz[graph[node][i]]==-1) {
                viz[graph[node][i]]=viz[node]+1;
                q.push(graph[node][i]);
            }
        }
    }
    return viz;
}

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

    vector <vector<int>> graph(n+1);

    for (int i=1;i<=m;i++) {
        int a,b;
        fin>>a>>b;
        graph[a].push_back(b);
    }

    vector <int> rez=bfs(graph,s);

    for (int i=1;i<=n;i++) {
        fout<<rez[i]<<" ";
    }
    return 0;
}