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

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


int main()
{
    int n,m,x;

    f>>n>>m>>x;

    vector<int> v[100001];
    int d[100001];

    for(int i=1;i<=m;i++){
        int a,b;
        f>>a>>b;
        v[a].push_back(b);
    }

    bool ok[100001]={};

    queue<int> q;
    q.push(x);
    d[x]=ok[x]=1;

    while(!q.empty()){
        int i=q.front();
        q.pop();

        for(unsigned j=0;j<v[i].size();j++)
            if(!ok[v[i][j]]){
                ok[v[i][j]]=1;
                d[v[i][j]]=d[i]+1;
                q.push(v[i][j]);
            }
    }

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

    return 0;
}