#include<bits/stdc++.h>
#define ll long long
#define N ((int)6e4 + 5)
#define MOD ((int)1e9 + 7)
#define MAX ((int)1e9 + 7)
#define MAXL ((ll)1e18 + 7)
#define MAXP ((int)1e3 + 7)
#define thr 1e-8
#define pi acos(-1)  /// pi = acos ( -1 )
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL)
#define endl "\n"

using namespace std;


int solve(int cur , int rem){
    if(rem < 0){
        return 0; /// Yes / No
        return MAX; /// min count
    }
    if(cur > last){
        if(rem == 0){
            return 1;
            return 0; /// min, max count
            return 1; /// number of ways
        }
        else{

        }
    }


    int ans = 0 ;/// YES / NO
    int ans = MAX; /// min count
    int ans = -MAX; /// max count
    int ans = 0; /// number of ways

    for(int i = 0 ; i <= cnt[cur] ; i++){
        int newRem = rem - val[cur] * i;
        ans = ans | solve(cur + 1 , newRem); /// YES / NO
        ans = min(ans , solve(cur + 1 , newRem) + i); /// min count
        ans = max(ans , solve(cur + 1 , newRem) + i); /// max count
        ans = ans + solve(cur + 1 , newRem); /// number of ways
    }
    /// 11 = 5 + 5 + 1
    /// 11 = 10 + 1;
    /// 11 = 1 + 1 .. + 1
    /// 11 = 2 + 2 + 2 + 2 +2 + 1

    return dpp[cur][rem] = ans;

} /// state: O( n * value )
/// TC : O ( n * value * count )


int main()
{


}