#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
vector<int>adiacenta[100001];
int n,m,s;
int distante[100001];
bool viz[100001];
queue<int>q;
int main()
{
    f >> n >> m>> s;
    for(int i = 1;i<=m;i++)
    {
        int x,y;
        f >> x >> y;
        adiacenta[x].push_back(y);
    }
    for(int i = 1;i<=100000;i++)
        distante[i]=-1;

    q.push(s);
    distante[s] = 0;
    while(!q.empty())
    {
        int curent = q.front();
        q.pop();
        for(auto x:adiacenta[curent])
        {
            if(distante[x] == -1)
            {
              distante[x] = distante[curent]+1;
              q.push(x);
            }
        }

    }
    for(int i=1;i<=n;i++)
        g << distante[i]<< " ";
}