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

using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n;
vector<int> bfs (vector<vector<int>>& adj, int s) {
    vector<int> sol(n, -1);
    sol[s]=0;
    queue<int> q;
    q.push(s);
    while (!q.empty()) {
        int nod=q.front();
        q.pop();
        for (auto i : adj[nod]) {
            if (sol[i]==-1) {
                q.push(i);
                sol[i]=sol[nod]+1;
            }
        }
    }
    return sol;
}
int main() {
    int m,s,i,a,b;
    fin>>n>>m>>s;
    s--;
    vector<vector<int>> adj(n);
    for (i=0; i<m; i++) {
        fin>>a>>b;
        a--;
        b--;
        adj[a].push_back(b);
    }
    vector<int> dist=bfs(adj, s);
    for (auto x : dist) {
        fout<<x<<" ";
    }
    fout<<endl;
    return 0;
}