Consider a real axis and segments on it. You are to write a program that processes queries of two kinds.

Query '

+ L R

' adds a segment from point L to point R. You program should print the number of segments that are (non-strictly) inside the new one.

Query '

- L R

' removes one segment from point L to point R. If there is no such segment, ignore this query.

You may assume that no more than 1000 segments will present on the axis simultaneously.

Each line of the input file contains one query. Query can be in the form '

- L R

' or '

+ L R

', where L and R are integers (-10⁹ ≤ L < R ≤ 10⁹). There will be no more than 250 · 10³ queries.

Print to the output one line for each '

+ L R

' query, containing the number of segments inside the added segment.

sample input	sample output
+ 1 2 + 1 2 + 0 3 - 1 2 + 1 2	0 1 2 1