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

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
vector <int> v[100005];
queue <int>q;
int n,m,s,dist[100005];

void read()
{
    fin >> n >> m >> s;
    for(int i=0;i<m;++i)
    {
        int x,y;
        fin >> x >> y;
        v[x].push_back(y);
    }
}

void bfs(int node)
{
    q.push(node);
    for(int i=0;i<=n;++i)
    {
        dist[i]=-1;
    }
    dist[node]=0;
    while(!q.empty())
    {
        int pr=q.front();
        q.pop();
        for(int i=0;i<v[pr].size();++i)
        {
            if(dist[v[pr][i]]==-1)
            {
                dist[v[pr][i]]=dist[pr]+1;
                q.push(v[pr][i]);
            }
        }
    }
}

int main()
{
    read();
    bfs(s);
    for(int i=1;i<=n;++i)
        fout << dist[i] << " ";
    return 0;
}