#include <fstream>
#include <climits>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n, m, s, i, j, x, y;
bool exp[100001];
int dist[100001];
vector <int> adj[100001];
queue<int> q;

void Bfs(int s)
{
    int x=0;
    exp[s]=1;
    q.push(s);
    while (!q.empty()) {
        x=q.front();
        q.pop();
        for (int i=0;i<adj[x].size();i++) {
            if (!exp[adj[x][i]]) {
                exp[adj[x][i]]=1;
                dist[adj[x][i]]=dist[x]+1;
                q.push(adj[x][i]);
            }
        }
    }
}

int main () {
    fin>>n>>m>>s;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        adj[x].push_back(y);
    }
    for (i=1;i<=n;i++) {
        dist[i]=INT_MAX;
    }
    dist[s]=0;
    Bfs(s);
    for (i=1;i<=n;i++) {
        if (dist[i]==INT_MAX)
            fout<<-1<<" ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}