#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<vector<int>> G;
vector<int> viz;
unsigned int n, a, i;
void rd()
{
    int x, y;
    f>>n>>a>>a;
    viz.resize(n+1);
    G.resize(n+1);
    while(f>>x>>y)
        G[x].push_back(y);
}
queue<int> q;
void BFS(int x)
{
    viz[x]=1;
    q.push(x);
    while(q.size())
    {
        x=q.front();
        q.pop();
        for(i=0;i<G[x].size();i++)
            if(!viz[G[x][i]])
            {
                viz[G[x][i]]=viz[x]+1;
                q.push(G[x][i]);
            }
    }
}
void afis()
{
    for(i=1;i<=n;i++)
        g<<viz[i]-1<<' ';
}
int main()
{
    rd();
    BFS(a);
    afis();
    return 0;
}