Divisible Union

**Problem.** Line 1: q. Each line: N k then k divisors d_i. Print how many of 1..N are divisible by AT LEAST one d_i. **Constraints:** 1 ≤ q ≤ 2000; 1 ≤ N ≤ 10^12; 1 ≤ k ≤ 4; 2 ≤ d_i ≤ 40. Bitmask inclusion-exclusion with LCM capping.