We are given array-'a' and array-'b' consisting of positive integers. How can I count all the permutation of array 'a' which are strictly lexicographically smaller than array-'b' ?

I know the brute-force solution. Is there any better solution available?

Thanks :)