#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout("bfs.out");

vector <int> v[100001];
queue <int> q;
bool vp[100001];
int d[100001];

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