func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 55, K = 55;   int n, k, M, t[K];   int main() {     scanf( %d%d%d , &n, &k, &M);     long long wholetime = 0;     for (int i = 0; i < k; i++) {       scanf( %d , &t[i]);       wholetime += t[i];     }     sort(t, t + k);     int ans = 0;     for (int whole = 0; whole <= n; whole++) {       long long time = whole * wholetime;       int pts = whole * (k + 1);       if (time <= M) {         for (int i = 0; i < k; i++) {           bool done = false;           for (int j = 0; whole + j < n; j++) {             if (time + t[i] <= M) {               time += t[i];               pts++;             }           }         }         ans = max(ans, pts);       }     }     printf( %d n , ans);     return 0;   }   