{ int answ;\r
if (((p+1)<<1) > R.n) return -1; // next(last), p+1 out of bounds\r
answ = nextLarger(R.tree,R.n,conv(p+1,R.n,R.lgn),0,R.lgn);\r
{ int answ;\r
if (((p+1)<<1) > R.n) return -1; // next(last), p+1 out of bounds\r
answ = nextLarger(R.tree,R.n,conv(p+1,R.n,R.lgn),0,R.lgn);\r