set<Multiplication> dp[sz];
    dp[0].insert(Multiplication());
    for(int i=0;i<n;i++) {
        if(arr[i] > 1)
            for(int j=k;j>=1;j--) {
                for(auto mult : dp[j-1]) {
                    ll cur = 0;
                    if(mult.ind.size()==0) {
                        cur = arr[i];
                    } else {
                        cur = mult.val * arr[i];
                    }
                    if(m % cur == 0)
                        dp[j].insert(Multiplication(mult, i));
                }
            }
    }