#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
const int maxi=100005;
int n,m,s;
bool viz[maxi];
int distanta[maxi];
vector<int> a[maxi];
queue<int> coada;
void BFS()
{
    int nod,vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(unsigned int i=0; i<a[nod].size(); ++i)
        {
            vecin=a[nod][i];
            if(distanta[vecin]==-1)
            {
                coada.push(vecin);
                distanta[vecin]=distanta[nod]+1;
            }
        }
    }
}
void citire()
{
    cin>>n>>m>>s;
    for(int i=1; i<=m; ++i)
    {
        int x,y;
        cin>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1; i<=n; ++i)
        distanta[i]=-1;
    distanta[s]=0;
    coada.push(s);
    BFS();
    for(int i=1; i<=n; ++i)
        cout<<distanta[i]<<" ";
}
int main()
{
    citire();
    return 0;
}