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

ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,a,b,d[100002];
bool viz[100002];

vector <int> v[100002];
queue <int> q;
void bfs()
{
    q.push(s);
    viz[s]=1;
    d[s]=1;
    while(!q.empty())
    {
        int nr=q.front();
        q.pop();
        viz[nr]=1;
        int ng=v[nr].size();
        for(int k=0;k<ng;++k)
        if(!viz[v[nr][k]])
        {
            d[v[nr][k]]=d[nr]+1;
            q.push(v[nr][k]);
        }
    }
}

int main()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
        f>>a>>b;
        v[a].push_back(b);
    }
    bfs();
    for(int i=1;i<=n;++i){g<<d[i]-1<<" ";}
    g<<'\n';
    return 0;
}