///BFS-
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ofstream fout("bfs.out");

int n,m,s,dist[100005],viz[100005];
vector <int> la[100005];
queue <int> q;

void citire(char* nume, int& n, int& m, int& s, vector<int> la[100005])
{
    ifstream fin(nume);
    fin >> n >> m >> s;
    for (int i=1; i<=m; i++)
    {
        int x, y;
        fin >> x >> y;
        la[x].push_back(y);
    }
    fin.close();
}

void bfs()
{
    q.push(s);
    for (int i=1; i<=n; i++)
    {
        dist[i]=-1;
        viz[s]=0;
    }
    dist[s]=0;
    viz[s]=1;
    while(!q.empty())
    {
        int nod=q.front(),vecin;
        q.pop();
        for (int i=0; i<la[nod].size(); i++)
        {
            vecin=la[nod][i];
            if (viz[vecin]==0)
            {
                q.push(vecin);
                dist[vecin]=dist[nod]+1;
                viz[vecin]=1;
            }
        }
    }
}

int main()
{
    citire("bfs.in",n,m,s,la);
    bfs();
    for (int i=1; i<=n; i++)
    {
        fout << dist[i] << " ";
    }
    fout.close();
    return 0;
}