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

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

vector <int> v[100005],cost;
queue <int> c;
int n,m,x,y,nr,s;
bool viz[100005];

void dfs(int nod)
{
    viz[nod]=1;
    int x=c.front();
    c.pop();
    cost[nod]=x;
    vector<int>::iterator it;
    for(it=v[nod].begin(); it!=v[nod].end();it++)
    {
        if(!viz[*it])
        {
            c.push(x+1);
            dfs(*it);
        }
    }
}

int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }

    cost.assign(n+1,-1);
    c.push(0);

    dfs(s);
    for(vector <int>::iterator it=cost.begin()+1;it!=cost.end();it++)
        fout<<*it<<' ';

    fin.close();
    fout.close();
    return 0;
}