class Solution {

public:

    /*

     * @param A: An integer array

     * @param k: A positive integer (k <= length(A))

     * @param target: An integer

     * @return: An integer

     */

    int kSum(vector<int> &A, int k, int target) {

        // write your code here

        int length = A.size();

        vector<vector<vector< int> > > result(length+,vector<vector<int > >(k+,vetor<int >(target+)));

        for(int i = ;i <= length;i++)

            result[i][][] = ;

        for(int i = ;i <= length;i++){

            for(int j = ;j <= k;j++){

                for(int p = ;p <= target;p++){

                    if((p - A[i]) >= )

                        result[i][j][p] = result[i-][j-][p-A[i]] + result[i-][j-][p];

                    else

                        result[i][j][p] = result[i-][j-][p];

                }

            }

        }

        return result[length][k][target];

    }

};