int solve(int n, vector < int > s, int d, int m){
    int ways = 0;
    for(auto it = s.cbegin(); it != s.cend(); ++it){
        if(d == std::accumulate(it, it + m, 0))
            ways++;
    }
    return ways;
}