N = int(inputs[0])
J = int(inputs[1])
numbers = []
max_num = int(math.pow(2, N-2))
add_num = int(math.pow(2, N-1)+1)
for i in range(max_num):
number = (2*i)+add_num
bin_number = str(bin(number)).replace("0b","")
number_data = {'bin': bin_number, 'div': []}
is_prime = False
for j in range(2,11):
base = 1
num_in_base = int(bin_number, j)
divisor = prime_man.checkDivisor(num_in_base)
if divisor > -1:
number_data['div'].append(divisor)
else:
is_prime = True
break
if not is_prime:
numbers.append(number_data)
if len(numbers) == J:
break
out.write("Case #"+str(testcase)+":\n")
for num in numbers:
out.write(num['bin'])
for divisor in num['div']:
