VU atrankinis turas 2005 m. ACM ICPC varžyboms

Peter is working on a project. To do his job, Peter needs permanent access to the Internet in the time interval B ≤ t ≤ E (1 ≤ B < E ≤ 10⁹). To have the access, Peter has to buy service cards from his local Internet Service Provider. There are N types of service chards (1 ≤ N ≤ 10⁵). The service card of type #i costs S_i (1 ≤ S_i ≤ 20 000) and allows connecting to the Internet from B_i till E_i (1 ≤ B_i < E_i ≤ 10⁹). It's guaranteed than for any t₀ (B ≤ t₀ ≤ E), there is at least one service card #i such that B_i ≤ t₀ ≤ E_i.

Your task is to calculate the minimal total cost of a set of service cards that would permit Peter having permanent access to Internet.

Input

The first line of the input text file contains the value of N, the second one - values B and E. Each of the following N lines describes one service card type and consists of values B_i, E_i, S_i. All numbers in the input file are integers and are separated by single spaces.

Output

The single line of the output text file should contain the total cost of service cards that Peter should buy to have permanent access to the Internet.

Sample Input

7
10 30
9 14 10
13 19 18
14 18 16
18 24 14
24 30 9
17 2005 24
15 20 14

Sample Output

49