Given array A[] and B[], to find how frequently each possible sums A[i] + B[j] appears we can use FFT
For example A = [1,2,3], B = [2,4].
The sum 3 can be obta
