Help me in solving A1 problem

My issue

plz help

My code

#include <bits/stdc++.h>
using namespace std;

// use dp 
bool funsum(int ind,int n,int m,vector<int>& v){
    if(m==0)return true;
    
    if(ind==n-1){
        if(m-v[ind]==0){
            return true;
        }
        return false;
    }
    
    
      bool a=false;
     bool b=false;
    if(m>=v[ind]){
     a=funsum(ind+1,n,m-v[ind],v);
      b=funsum(ind+1,n,m,v);}
      return a||b;
}
int main() {
	// your code goes here
	 int t;
	 cin>>t;
	 while(t--){
	     int n,m;
	     cin>>n>>m;
	     vector<int>v(n);
	     for(int i=0;i<n;i++){
	         cin>>v[i];
	     }
	    if(funsum(0,n,m,v)==1)cout<<"Yes"<<endl;
	    else cout<<"No"<<endl;
	 }
	return 0;
}

Problem Link: A1 Problem - CodeChef