Sereja adore tree today come revolutionary new type binary root treeshis new tree consist n level vertex index integer number level number vertex current level the tree root level 1 index 11 here pseudo code tree constructionthe global data integer array cnt leave rightcnt1 1fill array leave right value 1forlevel 1 level n level level 1 cntlevel 1 0 forposition 1 position cntlevel position position 1 ifthe value position power 1 2 4 8 leftlevelposition cntlevel 1 1 rightlevelposition cntlevel 1 2 cntlevel 1 cntlevel 1 2 rightlevelposition cntlevel 1 1 cntlevel 1 cntlevel 1 1 after pseudo code run cell cntlevel contain number vertex level level cell leftlevelposition contain number vertex level level1 leave child vertex index levelposition contain 1 vertex do not leave child similarly cell rightlevelposition responsible right child you tree n4 look like notesSerja love thing complicate tree add set Alevelposition vertex then Sereja execute m operation each operation follow type the format operation 1 t l r x for vertex levelposition leveltlpositionr add value x set Alevelposition the format operation 2 t v for vertex levelposition leveltpositionv find union set vertex subtree vertex levelposition Print size union set help Sereja execute operation in problem set contain distinct value like stdset c