#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n,h,m;
cin >> n >> h >> m;
int maxh[102];
for (int i = 1 ; i <= n; i++){
maxh[i] = h;
}
for (int i = 1; i <= m; i++){
int l,r,x;
cin >> l >> r >> x;
for (int j = l; j <= r; j++){
maxh[j] = min(maxh[j],x);
}
}
int ans = 0;
for (int i = 1; i <= n; i++){
ans+=maxh[i]*maxh[i];
}
cout << ans << endl;
}
1328A - Divisibility Problem | 339A - Helpful Maths |
4A - Watermelon | 476A - Dreamoon and Stairs |
1409A - Yet Another Two Integers Problem | 977A - Wrong Subtraction |
263A - Beautiful Matrix | 180C - Letter |
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |
1131A - Sea Battle | 118A - String Task |
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |