#include<cstdio>
#include<vector>

using namespace std;

#define maxn 100010

int n,m,start,l;
vector <int> a[maxn];
int g[maxn],s[maxn],cost[maxn];

void bfs(int nod)
{
     int i,j;
     memset(cost, -1, sizeof(cost));
          
     l = 1;
     cost[nod] = 0;
     s[l] = nod;
     
     for (i = 1; i <= l; i++)
         for (j = 1; j <= g[s[i]]; j++)
         if (cost[a[s[i]][j]] == -1)
         {
                 s[++l] = a[s[i]][j];
                 cost[s[l]] = cost[s[i]] + 1;
                 }
}
int main()
{
    int i,m,n,x,y;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    
    scanf("%d%d%d",&n,&m,&start);
    
    for (i = 1; i <= m; i++)
    {
        scanf("%d %d",&x,&y);
        a[x].push_back(y);
        }
        
    for (i = 1; i <= n; i++)
        g[i] = a[i].size();
    
    bfs(start);
    
    for (i = 1; i <= n; i++)
        printf("%d",cost[i]);
    printf("\n");

return 0;
}