#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int N=100001;
vector<int>H[N];
queue<int>Q;
int v[N];
bool uz[N];
void bfs(int start)
{
    Q.push(start);
    v[start]=0;
    uz[start]=1;
    while(Q.size())
    {
        int x=Q.front();
        for(vector<int>::iterator it=H[x].begin();it!=H[x].end();it++)
            {
              if(uz[*it]==0)
              {
                  uz[*it]=1;
                  Q.push(*it);
                  v[*it]=v[x]+1;
              }
            }
        Q.pop();
    }
}
int main()
{
    int n,m,i,a,b,s;
    fin>>n>>m>>s;
    for(i=1;i<=n;i++) v[i]=-1;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        H[a].push_back(b);
    }
    bfs(s);
    for(i=1;i<=n;i++) fout<<v[i]<<" ";
}