Novcani sistem

#include <bits/stdc++.h>
using namespace std;
long niz[10];
long sol[10];
long long n,m;
bool ind = false;
void solve(long long a, long long r){
    if(a == 0 && ind == false){
        cout << "DA" << endl;
        ind = true;
        for(long i = 0; i < n; i++){
            cout << sol[i] << " ";
        }
        cout << endl;
        exit(1);
    }
    for(long i = r; i < n; i++){
        long maks = a / niz[i];
        if(maks == 0){
            sol[i] = 0;
            solve(a,r+1);
        }
        else{
        for(long j = maks - 1; j <= maks; j++){
            sol[i] = j;
            solve(a - j * niz[i],r + 1);
        }
        }
    }
    return;
}
int main(){
    cin >> n >> m;
    for(long i = 0; i < n; i++){
        cin >> niz[i];
    }
    solve(m,0);
    if(ind == false){
        cout << "NE" << endl;
    }
}