Need an approach to solve this problem!

Problem : Given two strings containing lowercase alphabets count number of matches of non intersecting substrings in all distinct anagrams of 1st string such that they are equal to any anagram of 2nd string.

Example :
1) String 1: "ABC", String 2: "AB"
Answer = 4
Explanation : 'ABC','BAC','CAB','CBA' all contribute 1 such match each.

2) String 1: "ABCAB", String 2: "AB"
Answer = 40
Explanation : One possible Anagram of string 1 'ABABC' for which match count is 2 that is 'AB' and 'AB' while 'BABCA' contributes only one match that is 'BA' or 'AB'.

Constraints :
n,m are lengths of first and second strings
0 < n < 200
0 < m < 100