SP26771 KPRIMESB - Almost Prime Numbers Again

Almost Prime Numbers are composite numbers which are not divisible by certain prime numbers. Given K prime numbers and an integer N, find out the number of Almost Prime Numbers (ie. composite numbers not divisible by any of the given K prime numbers) that are not greater than N.

First line of input consists of an integer **T (1

For each test case, output a single line in the format **Case X: Y**, where **X** denotes the test case number and **Y** denotes the number of Almost Prime Numbers that are not greater than N.