Two sets of six faced dices, represented as arrays A and B consisting of N and M intergers. Given two arrays write a function which returns the minimum number of dice to be turned in order to make the sums of dice to be equal or -1 if its not possible.

Given A = [5] B=[1,1,6] return 1 as 5 == 1 + 1 + 3