#include <iostream>
#include <fstream>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

int n,m,s;
vector<vector<int>> v;
vector<int> distmin;

void BFS(int s)
{
    queue<int> q;
    distmin[s]=0;
    q.push(s);

    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int v2:v[nod])
        {
            if(distmin[v2]==-1)
            {
                distmin[v2]=distmin[nod]+1;
                q.push(v2);
            }
        }
    }
}

int main()
{
    ifstream fin("dfs.in");
    ofstream fout("dfs.out");
    fin>>n>>m>>s;
    v.assign(n+1,{});
    distmin.assign(n+1,-1);
    for(int i=0;i<m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
    BFS(s);
    for(int i=1;i<=n;i++)
    {
        fout<<distmin[i]<<" ";
    }
    return 0;
}