B"Ira is developing a computer game. This game features randomized generation and difficulty of levels. To achieve randomized difficulty, some enemies in each level are randomly replaced with stronger ones. To describe how do the levels in the game look, let's introduce a coordinate system in such a way that Ox axis goes from left to right, and Oy axis goes from bottom to top. A level is a rectangle with opposite corners in points (0, 0) and (a, b) . Each enemy's position is a point in this rectangle. As for now, Ira has implemented one type of enemy in the game, in two different versions -- basic and upgraded. Both versions of enemies Ira has implemented fire laser rays in several directions: Laser rays pass through enemies and are blocked only by the borders of the level (sides of the rectangle that denotes the level). Enemies are unaffected by lasers. The level Ira is working on has n enemies. The i -th enemy is in the point (x_i, y_i) , and it has a probability of p_i to be upgraded (it's either upgraded with probability p_i , or basic with probability 1-p_i ). All these events are independent. Ira wants to estimate the expected difficulty. She considers that a good way to evaluate the difficulty of the level is to count the number of parts in which the level is divided by the laser rays. So, she wants to calculate the expected number of these parts. Help her to do the evaluation of the level! The first line contains three integers n , a and b ( 1 <= n <= 100 ; 2 <= a, b <= 100 ) -- the number of enemies in the level and the dimensions of the level. Then n lines follow, the i -th of them contains three integers x_i , y_i and p'_i ( 1 <= x_i <= a - 1 ; 1 <= y_i <= b - 1 ; 1 <= p'_i <= 999999 ), meaning that the i -th enemy is located at (x_i, y_i) and has a probability of frac{p'_i}{10^6} to be upgraded"...