#include <bits/stdc++.h>
using namespace std;
const int N=100000;
struct node{
int val;
int left;
int right;
}q[N];
int n,a;
int ans;
void dfs(int k)
{
if(q[k].left)
dfs(q[k].left);
ans++;
if(q[k].val==a)
{
cout<<ans<<endl;
return ;
}
if(q[k].right)
dfs(q[k].right);
}
int main()
{
cin>>n>>a;
for(int i=1;i<=n;i++)
cin>>q[i].val>>q[i].left>>q[i].right;
dfs(1);
return 0;
}