func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 59;   int t[N];   inline int read() {     int s = 1, a = 0;     char ch = getchar();     while (ch <  0  || ch >  9 ) {       if (ch ==  - ) s = -1;       ch = getchar();     }     while (ch >=  0  && ch <=  9 ) {       a = a * 10 + ch -  0 ;       ch = getchar();     }     return s * a;   }   int main() {     int n = read(), k = read(), m = read(), s = 0;     for (int i = 1; i <= k; i++) t[i] = read(), s += t[i];     sort(t + 1, t + k + 1);     long long res = 0;     for (int i = 0; i <= n; i++) {       long long tim = i * s, cur = i * (k + 1);       if (tim > m) break;       for (int j = 1; j <= k; j++) {         if (tim + (n - i) * t[j] <= m)           tim += (n - i) * t[j], cur += (n - i);         else {           while (tim + t[j] <= m) tim += t[j], cur++;           break;         }       }       res = max(res, cur);     }     return 0 * printf( %d n , res);   }   