func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize(2)   #pragma GCC optimize(3)   using namespace std;   inline int read() {     int x = 0, neg = 1;     char op = getchar();     while (!isdigit(op)) {       if (op ==  - ) neg = -1;       op = getchar();     }     while (isdigit(op)) {       x = 10 * x + op -  0 ;       op = getchar();     }     return neg * x;   }   inline void print(int x) {     if (x < 0) {       putchar( - );       x = -x;     }     if (x >= 10) print(x / 10);     putchar(x % 10 +  0 );   }   const int N = 1000005;   long long f[N], g[N];   int k, q, mul = 1;   void ckmax(long long &a, long long b) {     if (a < b) a = b;   }   void work() {     int tmp = k, t = 1, x;     x = read();     memset(g, 192, sizeof(g));     for (int v = 0; v < 10; v++) {       long long cost = 1ll * mul * v;       long long w = v % 3 == 0 ? 1ll * (v / 3) * x : 0;       for (int i = 0; i < N - cost; i++) {         ckmax(g[i + cost], f[i] + w);       }     }     memcpy(f, g, sizeof(g));     while (tmp > t) {       tmp -= t;       long long cost = 1ll * mul * t;       cost *= 3;       long long w = 1ll * x * t;       if (cost < N) {         for (int i = N - 1; i >= cost; i--) {           ckmax(f[i], f[i - cost] + w);         }       }       t <<= 1;     }     long long cost = 1ll * mul * tmp;     cost *= 3;     long long w = 1ll * x * tmp;     if (cost < N) {       for (int i = N - 1; i >= cost; i--) {         ckmax(f[i], f[i - cost] + w);       }     }     mul *= 10;   }   int main() {     k = (read() - 1) * 3;     memset(f, 192, sizeof(f)), f[0] = 0;     for (int i = 1; i <= 6; i++) work();     q = read();     while (q--) {       int x = read();       printf( %lld n , f[x]);     }     return 0;   }   