Arrays Sum

You are given an array A, consisting of N integers and an array B, consisting of M integers. The subsequence of A is the array that can be obtained by picking the elements at the arbitrary sorted set of positions from A. Your task is to count the number of such subsequences C of A that: - C contains exactly M elements. - The array (C+B) is non-decreasing. Here by + operation, we mean element