#include <iostream>
#include <fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
int n,m,s;
vector<int>adiacenta[100001];
queue<int>q;
int pasi[100001];
int main()
{
    f >> n >> m >> s;
    for(int i = 1;i<=m;i++)
    {
        int x,y;
        f >> x >> y;
        adiacenta[x].push_back(y);
    }
    q.push(s);
    pasi[s] = 1;
    while(!q.empty())
    {
        int curent = q.front();;
        q.pop();
        for(auto x:adiacenta[curent])
        {
            if(pasi[x] == 0)
            {
                pasi[x] = pasi[curent]+1;
                q.push(x);
            }
        }
    }
    for(int i = 1;i<=n;i++)
        g << pasi[i]-1<< " ";
}