#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define infinit (1<<28)

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int v, e, s;
int x, y;
vector<int> graf[100005];
queue<int> q;
int dist[100005];

void bfs()
{
    dist[s] = 1;
    q.push(s);
    while (!q.empty())
    {
        int vf = q.front();
        q.pop();
        for(auto& vec: graf[vf])
        {
            if(dist[vec] > 0)
                continue;
            q.push(vec);
            dist[vec] = dist[vf]+1;
        }
    }
}

int main() {

    f>>v>>e>>s;

    for(int i=1; i<=e; i++)
    {
        f>>x>>y;
        graf[x].push_back(y);
    }
    bfs();
    for(int i=1; i<=v; i++)
        g<<dist[i]-1<<" ";
    return 0;
}