human
Number of M | Function to find the number of M - length sorted arrays possible using numbers from the range [ 1 , N ].
If size becomes equal to m , that means an array is found.
Include current element , increase size by 1 and remain on the same element as it can be included again.
Exclude current element.
Return the sum obtained in both the cases.
Driver Code.
Given Input.
Function Call"
Solution in Python:
 Give me a code to number of M and the other steps required?
assistant
#Here is code to number of M and the other steps required.
 def countSortedArrays ( start , m , size , n ) :
	if ( size == m ) :
		return 1
	if ( start > n ) :
		return 0
	notTaken , taken = 0 , 0
	taken = countSortedArrays ( start , m , size + 1 , n )
	notTaken = countSortedArrays ( start + 1 , m , size , n )
	return taken + notTaken
if __name__ == ' _ _ main _ _ ' :
	n , m = 2 , 3
	print ( countSortedArrays ( 1 , m , 0 , n ) )