Return the Number of ways to insert a character to increase the longest Common Subsequence by one
static int numberofways ( String A , String B , int N , int M ) { List < int > [ ] pos = new List < int > [ MAX ] ;