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 ) { Vector < Integer > [ ] pos = new Vector [ MAX ] ;