//  int subset=0;

public boolean canPartitionKSubsets(int[] nums, int k) {
         boolean cover[]= new boolean[nums.length];
         int sum=0;
         for(int i=0;i<nums.length;i++){
             sum+=nums[i];
         }
         if(sum%k!=0){
             return false;
         }
         int product=sum/k;

          canPartitionKSubsets(nums,product,cover,0,0);
          System.out.println(subset+" "+ product);
          if(subset==k){
              return true;
          }
          return false;

}
HashMap<Integer,Integer> map= new HashMap<>();
  int call=0;
public void canPartitionKSubsets(int[] nums, int target,boolean [] cover,int current,int currentsum) {

    if(currentsum>target){
        return;
    }
    // if(cover[current]){
    //     return;
    // }
  
    if(currentsum==target){
  
     //   subset++;
        int ind=current-1;
     //   System.out.println(ind);
        map.put(ind,1);
        call++;
     
        canPartitionKSubsets(nums,target,cover,0,0);
       
    }
    for(int i=current;i<nums.length;i++){
         if(cover[current]||currentsum+nums[i]>target||map.containsKey(i)){
            continue;
         }
   
          cover[i]=true;
       //  System.out.println("Index "+i+" "+currentsum+" "+call);
         canPartitionKSubsets(nums,target,cover,i+1,currentsum+nums[i]);
         
         cover[i]=false;
          
        
    }
}