func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long INF = 1e9 + 7;   const int N = 5e2 + 10;   int a[N][N];   int b[N][N];   int c[N][N];   int minv[N];   int main() {     int n, m, k;     scanf( %d%d%d , &n, &m, &k);     memset((minv), (0x3f), sizeof(minv));     for (int i = 1; i <= n; i++) {       scanf( %*s );       for (int j = 1; j <= m; j++) {         cin >> a[i][j] >> b[i][j] >> c[i][j];       }     }     int ans = 0;     for (int i = 1; i <= n; i++) {       for (int j = 1; j <= n; j++) {         vector<int> v;         for (int o = 1; o <= m; o++) {           for (int t = 0; t < c[i][o]; t++)             v.push_back(max(0, b[j][o] - a[i][o]));         }         sort(v.rbegin(), v.rend());         int sum = 0;         for (int o = 0; o < k && o < v.size(); o++) sum += v[o];         ans = max(ans, sum);       }     }     cout << ans << endl;     return 0;   }   