Given $21$d arrays of integer numbers of length N$,$ find the number of ways to split them at point k $($without empty arrays$)$ so that sum$($A$[0$:k$])==$ sum$($A$[$k$]),$ sum$($B$[0$:k$])==$ sum$($B$[$k:$])$ and sumA $==$ sumB.