Return the Number of ways to insert a character to increase the Longest Common Subsequence by one
def numberofways ( A , B , N , M ) : NEW_LINE INDENT pos = [ [ ] for _ in range ( MAX ) ] NEW_LINE DEDENT