#include <iostream>
#include <fstream>
#include <vector>


using namespace std;

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

class Queue
{
    vector<int> q;
    int st, dr;
public:
    Queue(int dim){
        q.resize(dim+10);
        st=1;
        dr=0;
    }
    void push(int x){
        dr++;
        q[dr]=x;
    }
    bool vida(){
        return st>dr;
    }
    int top()
    {
        if(!vida())
            return q[st];
        else
            return -1;
    }
    void pop()
    {
        if(!vida())
            st++;
    }
};

int n, m, s;
vector<vector<int>> la;
int vizitat[100005];
int dist[100005];

void bfs(Queue q)
{
    q.push(s);
    vizitat[s]=1;

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

    dist[s]=0;
    while(!q.vida())
    {
        int x = q.top();
        q.pop();
        for(int i=0; i<la[x].size(); ++i)
        {
            int y=la[x][i];
            if(!vizitat[y])
            {
                q.push(y);
                vizitat[y]=1;
                dist[y]=dist[x]+1;
            }
        }
    }
}

int main()
{
    fin >> n >> m >> s;
    la.resize(n+1);
    for(int i=0; i<m; ++i)
    {
        int x, y;
        fin >> x >> y;
        la[x].push_back(y);
    }
    Queue q(n);
    bfs(q);
    for(int i=1; i<=n;++i)
        fout << dist[i] << " ";

}