#include <fstream>
#include <vector>
#include <queue>
#define DIM 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,st,x,y,nod,sol[DIM];
vector<int> l[DIM];
queue<int> q;

void bfs(int st) {
    sol[st]=0;
    q.push(st);
    while (!q.empty()) {
        int nod=q.front();
        q.pop();
        for (int i=0;i<l[nod].size();i++) {
            int vec=l[nod][i];
            if (sol[vec]==-1) {
                sol[vec]=sol[nod]+1;
                q.push(vec);
            }
        }
    }
}

int main() {
    fin>>n>>m>>st;
    while (m--) {
        fin>>x>>y;
        l[x].push_back(y);
    }
    for (int i=1;i<=n;i++)
        sol[i]=-1;
    bfs(st);
    for (int i=1;i<=n;i++)
        fout<<sol[i]<<" ";
    return 0;
}