Artyom123 Code for problem B has two main functions, probably you could edit that. Thanks for the tutorial!

Your code seems to be incomplete hard to tell what's wrong. What is ha? A hashmap?

1. for all queries with a is equal to 1 meaning the range of numbers should be greater than or equal to x then store the highest of them in a variable high
2. for all queries with a is equal to 2 meaning the range of numbers should be lesser than or equal to x then store the lowest of them in a variable low

We encompass the range from high to low.

1. Now for a is equal to 3 store them in an array/set

2. Now find numbers in the set which lie between high and low including high and low, let them be equal to cnt

high-low+1-cnt will be the answer

Thanks for the fast editorial and a wonderful contest!

W contest, interesting problems

I have a headache after the contest. Can anyone else relate, or is it just me? ;_;