func_code_string: #include <bits/stdc++.h>   using namespace std;   const int INF = 0x3f3f3f3f;   const long long LINF = 0x3f3f3f3f3f3f3f3f;   const double EPS = 1e-9;   const int maxn = (int)1e5 + 9;   int n, q, t[maxn], k[maxn], d[maxn];   int x[150];   int ans[maxn];   void Solve() {     while (cin >> n >> q) {       for (int i = (1); i <= (q); i++) cin >> t[i] >> k[i] >> d[i];       memset(ans, (-1), sizeof(ans));       for (int i = (1); i <= (q); i++) {         int f = 0, nt = 0;         for (int j = (1); j <= (n); j++) {           if (x[j] <= t[i]) {             nt++;           }           if (nt == k[i]) {             f = 1;             break;           }         }         if (f) {           int pp = 0, nt = 0;           for (int j = (1); j <= (n); j++) {             if (x[j] <= t[i]) {               x[j] = t[i] + d[i];               nt++;               pp += j;             }             if (nt == k[i]) break;           }           ans[i] = pp;         }       }       for (int i = (1); i <= (q); i++) {         cout << (ans[i]) << endl;         ;       }     }   }   int main() {     iostream::sync_with_stdio(false), cin.tie(0), cout.tie(0);     Solve();     return 0;   }   