#include <fstream>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,st,x,y;
queue<int>q;
int viz[1000001];
vector<int>a[100001];
int main()
{
    fin>>n>>m>>st;
    for(int i=0;i<m;i++){
        fin>>x>>y;
        if(x!=y)
            a[x].push_back(y);
    }

     for(int i=1;i<=n;i++)
          sort(a[i].begin(), a[i].end());

    viz[st]=1;
    q.push(st);
    while(!q.empty()){
        int k=q.front();
        for(int i=0;i<a[k].size();i++){
                int vec=a[k][i];
            if(viz[vec]==0){
                q.push(vec);
                viz[vec]=viz[k]+1;
            }
        }
       q.pop();

    }

    for(int i=1;i<=n;i++)
        fout<<viz[i]-1<<" ";


    return 0;
}