Almost equivalent to Project Euler's first question:

> If we list all the natural numbers below 10 that are multiples of 3 or
> 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
> 
> Find the sum of all the multiples of 3 or 5 below 1000.

Given a positive integer `N` and a set of at least one positive integer `A`, output the sum of all positive integers less than `N` that are multiples of at least one member of `A`.

For example, for the Project Euler case, the input would be:

    1000
    3
    5

##Test cases:

    50, 2
    600

    10, 3, 5
    23

    28, 4, 2
    182

    19, 7, 5
    51

    50, 2, 3, 5
    857