#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,s;
vector <vector<int> > a(100000);
int main()
{int m;
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        a[x].push_back(y);
    }
    int viz[100000]={0};
    viz[s]=1;
    queue<int> c;
    c.push(s);
    while(!c.empty())
    {
        int var=c.front();
        c.pop();
        for(int i=0;i<a[var].size();i++)
            if(viz[a[var][i]]==0)
        {
            viz[a[var][i]]=viz[var]+1;
            c.push(a[var][i]);
        }
    }
    for(int i=1;i<=n;i++)
        g<<viz[i]-1<<" ";
    return 0;
}