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

int main ()
{
    int n,m,s,x,y,start=0;

    vector<int> queue;
    vector<int> dist;

    vector<vector<int>> v;
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin>>n>>m>>s;
    v.resize(n+1);
    dist.resize(n+1);
    for(int i=1;i<=n;i++)
    {
        dist[i]=-1;
    }

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

    dist[s]=0;
    queue.push_back(s);
    
    while(queue.size()>start)
    {
        int element = queue[start++];  
        for(auto& e: v[element])
        {
            if(dist[e]==-1)
            {
                dist[e]=dist[element]+1;
                queue.push_back(e);
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        fout<<dist[i]<<" ";
    }
    fout.close();
         

    return 0;
}