#include <fstream>
#include <vector>
#include <deque>

#define ll long long

using namespace std;

ifstream cin ("bfs.in");
ofstream cout ("bfs.out");

ll n,m,i,s,a,b,act;
struct adat
{
    bool seen=false;
    ll step=-1;
    vector <ll> sz;
};

int main()
{
    cin>>n>>m>>s;
    vector <adat> x(n+1);
    for (i=1;i<=m;++i)
    {
        cin>>a>>b;
        x[a].sz.push_back(b);
    }

    deque <ll> v;
    v.push_back(s);
    x[s].seen=true;
    x[s].step=0;
    while (!v.empty())
    {
        act=v[0];
        v.pop_front();
        for (auto e:x[act].sz)
        {
            if (!x[e].seen)
            {
                x[e].seen=true;
                x[e].step=x[act].step+1;
                v.push_back(e);
            }
        }
    }
    for (i=1;i<=n;++i) cout<<x[i].step<<" ";
    return 0;
}