#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int NMAX=100000;
vector <int>G[NMAX+5];
queue <int>q;
int viz[NMAX+5];
void BFS(int nod)
{
   int i;
   viz[nod]=1;
   q.push(nod);
   while(!q.empty())
   {
       nod=q.front();
       q.pop();
       for(i=0;i<G[nod].size();i++)
       {
           if(viz[G[nod][i]]==0)
           {
               q.push(G[nod][i]);
               viz[G[nod][i]]=viz[nod]+1;
           }
       }
   }
}
int main()
{
    int n, m, s, i, x, y;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
    BFS(s);
    for(i=1;i<=n;i++)
        fout<<viz[i]-1<<" ";
    fout<<"\n";
    return 0;
}