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

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

#define MAXN 100000
#define MAXM 1000000

vector<int> v[MAXN+1];
queue<int> q;
int n, m, s;
int dist[MAXN+1];

void bfs() {
    int nod;
    q.push(s);
    dist[s]=1;
    while(!q.empty()) {
        nod=q.front();
        q.pop();
        for(auto i:v[nod])
            if(!dist[i])
                dist[i]=dist[nod]+1, q.push(i);
    }
}

int main() {
    cin>>n>>m>>s;
    int i, x, y;
    for(i=0; i<m; i++) {
        cin>>x>>y;
        v[x].push_back(y);
    }
    bfs();
    for(i=1; i<=n; i++)
        cout<<dist[i]-1<<" ";
}