You are given N fractions represented as 2 arrays X and Y. Write a function to count all possible ways to choose fractions that sum to 1

X = [1, 1, 2]
Y = [3, 2, 3]

Ans is 1 (1/3, 2/3)