#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

struct nod
{
    vector <int> v;
    bool viz=false;
    int cost=-1;
};

nod a[100000];
queue <nod> q;

int main()
{
    int n, m, s;

    fin >> n >> m >> s;

    for(int i=1; i<=m; i++)
    {
        int ct, vec;

        fin >> ct >> vec;

        a[ct].v.push_back(vec);
    }

    a[s].viz=true;
    a[s].cost=0;
    q.push(a[s]);

    nod ct;

    while(!q.empty())
    {
        ct=q.front(); q.pop();

        for(int i=0; i<ct.v.size(); i++)
        {
            if(!a[ct.v[i]].viz)
            {
                a[ct.v[i]].cost=ct.cost+1;
                a[ct.v[i]].viz=true;

                q.push(a[ct.v[i]]);
            }
        }
    }

    for(int i=1; i<=n; i++)
        fout << a[i].cost << " ";

    return 0;
}