#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

struct nod{ int d;
            vector<int> v;
            bool used;
          };

int n, m, s;
nod a[100003];
queue<int> q;

int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
        int x, y;
        fin>>x>>y;
        a[x].v.push_back(y);
    }
    q.push(s);
    a[s].used=1;
    for(int i=1;i<=n;++i) a[i].d=-1;
    a[s].d=0;
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        for(int i=0;i<a[p].v.size();++i)
        {
            if(!a[a[p].v[i]].used)
            {
                q.push(a[p].v[i]);
                a[a[p].v[i]].d=a[p].d+1;
                a[a[p].v[i]].used=1;
            }
        }
    }
    for(int i=1;i<=n;++i)
    {
        fout<<a[i].d<<" ";
    }
    return 0;
}