#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int s, n, m, nr, ans[100001], d[100001];

vector <int> v[100001];
queue <int> q;

int main()
{
    fin >> n >> m >> s;

    for(int i = 1; i <= m; i++)
    {
        int x, y;

        fin >> x >> y;

        v[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
        d[i] = -1;

    d[s] = 0;
    q.push(s);
    while(!q.empty())
    {
        int k;

         k = q.front();
         q.pop();



        for(unsigned int i = 0; i < v[k].size(); i++)
           if(d[v[k][i]] == -1)
          {
              q.push(v[k][i]);

              d[v[k][i]] = d[k]+1;
          }


    }

    for(int i = 1; i <= n; i++)
            fout << d[i] << " ";
    return 0;
}