How do I find the number of ways to modify two strings such that they are anagrams?

Question

---

Sample input:

                              4      #Each testcase has two strings
                              abc