#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int NMAX = 1000005;

vector < vector <int> > adjList;
queue <int> q;

int dist[NMAX],viz[NMAX];

int main()
{
    int n,m,s,x,y;
    fin>>n>>m>>s;
    adjList.resize(n + 1);
    for(int i = 1;i <= m;i++)
    {
        fin>>x>>y;
        adjList[x].push_back(y);
        dist[i] = -1;
    }
    q.push(s);
    viz[s] = 1;
    dist[s] = 0;
    while(!q.empty()){
        int cand = q.front();
        q.pop();
        for(auto u : adjList[cand]){
            if(!viz[u])
            {
                viz[u] = 1;
                dist[u] = dist[cand] + 1;
                q.push(u);
            }
        }
    }
    for(int i = 1;i <= n;i++)
    {
        fout<<dist[i]<<" ";
    }
    return 0;
}