Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Karen and Cards

time limit per test

2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputKaren just got home from the supermarket, and is getting ready to go to sleep.

After taking a shower and changing into her pajamas, she looked at her shelf and saw an album. Curious, she opened it and saw a trading card collection.

She recalled that she used to play with those cards as a child, and, although she is now grown-up, she still wonders a few things about it.

Each card has three characteristics: strength, defense and speed. The values of all characteristics of all cards are positive integers. The maximum possible strength any card can have is *p*, the maximum possible defense is *q* and the maximum possible speed is *r*.

There are *n* cards in her collection. The *i*-th card has a strength *a*_{i}, defense *b*_{i} and speed *c*_{i}, respectively.

A card beats another card if at least two of its characteristics are strictly greater than the corresponding characteristics of the other card.

She now wonders how many different cards can beat all the cards in her collection. Two cards are considered different if at least one of their characteristics have different values.

Input

The first line of input contains four integers, *n*, *p*, *q* and *r* (1 ≤ *n*, *p*, *q*, *r* ≤ 500000), the number of cards in the collection, the maximum possible strength, the maximum possible defense, and the maximum possible speed, respectively.

The next *n* lines each contain three integers. In particular, the *i*-th line contains *a*_{i}, *b*_{i} and *c*_{i} (1 ≤ *a*_{i} ≤ *p*, 1 ≤ *b*_{i} ≤ *q*, 1 ≤ *c*_{i} ≤ *r*), the strength, defense and speed of the *i*-th collection card, respectively.

Output

Output a single integer on a line by itself, the number of different cards that can beat all the cards in her collection.

Examples

Input

3 4 4 5

2 2 5

1 3 4

4 1 1

Output

10

Input

5 10 10 10

1 1 1

1 1 1

1 1 1

1 1 1

1 1 1

Output

972

Note

In the first test case, the maximum possible strength is 4, the maximum possible defense is 4 and the maximum possible speed is 5. Karen has three cards:

- The first card has strength 2, defense 2 and speed 5.
- The second card has strength 1, defense 3 and speed 4.
- The third card has strength 4, defense 1 and speed 1.

There are 10 cards that beat all the cards here:

- The card with strength 3, defense 3 and speed 5.
- The card with strength 3, defense 4 and speed 2.
- The card with strength 3, defense 4 and speed 3.
- The card with strength 3, defense 4 and speed 4.
- The card with strength 3, defense 4 and speed 5.
- The card with strength 4, defense 3 and speed 5.
- The card with strength 4, defense 4 and speed 2.
- The card with strength 4, defense 4 and speed 3.
- The card with strength 4, defense 4 and speed 4.
- The card with strength 4, defense 4 and speed 5.

In the second test case, the maximum possible strength is 10, the maximum possible defense is 10 and the maximum possible speed is 10. Karen has five cards, all with strength 1, defense 1 and speed 1.

Any of the 972 cards which have at least two characteristics greater than 1 can beat all of the cards in her collection.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/14/2021 23:19:27 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|