import math
from collections import deque
n,m = map(int,input().split())
athletes = []
for i in range(m):
l,r,m,c = map(int,input().split())
athletes.append((l,r,m,c))
total = 0
for i in range(n):
sec = i + 1
fastest = None
for j in range(len(athletes)):
if athletes[j][0] <= sec and athletes[j][1] >= sec:
if fastest == None:
fastest = j
continue
if athletes[j][2] < athletes[fastest][2]:
fastest = j
if fastest == None:
continue
total += athletes[fastest][3]
print(total)
1610A - Anti Light's Cell Guessing | 349B - Color the Fence |
144A - Arrival of the General | 1106A - Lunar New Year and Cross Counting |
58A - Chat room | 230A - Dragons |
200B - Drinks | 13A - Numbers |
129A - Cookies | 1367B - Even Array |
136A - Presents | 1450A - Avoid Trygub |
327A - Flipping Game | 411A - Password Check |
1520C - Not Adjacent Matrix | 1538B - Friends and Candies |
580A - Kefa and First Steps | 1038B - Non-Coprime Partition |
43A - Football | 50A - Domino piling |
479A - Expression | 1480A - Yet Another String Game |
1216C - White Sheet | 1648A - Weird Sum |
427A - Police Recruits | 535A - Tavas and Nafas |
581A - Vasya the Hipster | 1537B - Bad Boy |
1406B - Maximum Product | 507B - Amr and Pins |