#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int nmax=100005;
vector <int> g[nmax];
vector <int> viz(nmax,-1);
int n,m,s;
void BFS(int s)
{
    queue <int> q;
    q.push(s);
    viz[s]=0;
    while(!q.empty())
    {
        int v=q.front();
        for(unsigned int i=0; i<g[v].size(); i++)
            if(viz[g[v][i]]==-1)
            {
                viz[g[v][i]]=viz[v]+1;
                q.push(g[v][i]);
            }
        q.pop();
    }

}
int main()
{
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        g[x].push_back(y);
    }
    BFS(s);
    for(int i=0; i<n; i++)
        fout<<viz[i+1]<<" ";
}