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

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

vector<int>a[100001];
queue<int>q;
int n,m,x,viz[100001];

void bfs(int x){
    q.push(x);
    viz[x]=1;
    int nod;
    while(!q.empty()){
        nod=q.front();
        q.pop();
        for(unsigned i=0;i< a[nod].size(); i++)
            if(viz[a[nod][i]]==0){
                q.push(a[nod][i]);
                viz[a[nod][i]]=viz[nod]+1;
            }
    }
}


int main()
{
    int i,u,t;
    f>>n>>m>>x;
    for(i=1;i<=m;i++){
        f>>u>>t;
        a[u].push_back(t);
    }
    bfs(x);
    for(i=1;i<=n;i++)
        if(viz[i]==0)
            g<<"-1 ";
        else
            g<<viz[i]-1<<" ";
    return 0;
}