Train King

시간 제한2초메모리 제한512 MB

요약

A와 B 사이를 오가는 열차의 시간표와 객차 수가 주어질 때, 같은 객차를 두 번 타지 않고 옮길 수 있는 물질의 최대량을 구한다.

난이도: 보통10점 중 7점
유형: 그래프, 최단 경로, 구현
정답자: 아직 제출이 없습니다

문제

Roland has been given a mission of dangerous material transfer by Train King. The material is stored in the station A and subject to being transferred to the station B. He will bring it by direct trains between A and B, one (or zero) unit per ride.

Your task is to write a program to find out the most optimal way of his bringing. Your program will receive the timetable of trains on the mission day and should report how many units of material can be transferred at the end. Be aware that there can be trains which can go to the past time or the same time which train leaved the station.

Each train consists of one or more cars. Roland is disallowed to ride the same car of the same train multiple times. This restriction avoids time paradox. He is still allowed to get on a different car, though. You can assume he can change trains instantly.

입력

The first line contains two integers NAB and NBA (0 ≤ NAB, 0 ≤ NBA and NAB + NBA ≤ 50). NAB denotes the number of trains from A to B; NBA denotes the number from B to A.

The next NAB lines describe the information about trains from A to B. Each line gives the information of one train with three integers Ci, Di and Ai (1 ≤ Ci ≤ 10, 0 ≤ Di, Ai < 86400) : the number of cars, the departure time, and the arrival time.

The next NBA lines describe the information about trains from B to A. The information is given in the same format.

출력

Print the maximum amount, in units, of dangerous material that can be transferred.

예제2

예제 1
입력
```
1 1
10 100 0
10 100 0
```
예상 출력
```
10
```

예제 2

입력

5 5
10 0 100
10 200 300
10 400 500
10 600 700
10 800 900
10 100 200
10 300 400
10 500 600
10 700 800
10 900 1000

예상 출력