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


int main()
{
    ifstream f("bfs.in");
    ofstream g("bfs.out");

    queue <int> q;
    int n, m, s, x, y, cur;
    f>>n>>m>>s;
    vector < vector<int> >l(n+1);
    vector <int> distance(n+1,-1);

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

    q.push(s);
    distance[s]=0;
    cur=1;
    while(q.size()!=0)
    {
        x=q.front();
        for(int i=0;i<l[x].size();i++)
        {
            if(distance[l[x][i]]==-1&&x!=l[x][i])
            {
                distance[l[x][i]]=distance[x]+1;
                q.push(l[x][i]);
            }
        }
        q.pop();

    }
    for(int i=1;i<=n;i++)
        g<<distance[i]<<" ";







    return 0;
}