#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector<int> graf[100005];
queue<int> q;
int sol[100005];

int n, m, s;
int x, y;

void citire()
{
    f>>n>>m>>s;
    for(int i=0; i<m; i++)
    {
        f>>x>>y;
        graf[x].push_back(y);
    }
}

void bfs()
{
    q.push(s);
    sol[s]=1;
    int start;
    while(!q.empty())
    {
        start=q.front();
        q.pop();
        for(auto &v : graf[start])
        {
            if(sol[v]==0)
            {
                sol[v]=sol[start]+1;
                q.push(v);
            }
        }
    }
    for(int i=1; i<=n; i++)
        g<<sol[i]-1<<" ";
}

int main()
{
    citire();
    bfs();
    return 0;
}