#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int n_max=100000;
bool viz[n_max+1];
int dist[n_max+1];
vector<vector<int>> graph;
queue <int> q;

void bfs(int node)
{
    q.push(node);
    dist[node]=1;
    while(!q.empty())
    {
        node = q.front();
        for(int vecin : graph[node])
            if( dist[vecin]==0){
                q.push(vecin);
                dist[vecin]= dist[node]+1;              
            }
                
        q.pop();
    }
}
int main()
{    
    int n,m,s;
    fin>>n>>m>>s;
    graph.resize(n+1);
    for(int i=1;i<=m;i++)
    {
        int a,b;
        fin>>a>>b;
        graph[a].push_back(b);
        
    }
    bfs(s);
    for(int i=1;i<=n;i++)
        fout<<dist[i]-1<<' ';
    return 0;
}