给定n，找出有多少个n位数字，使得这个数字在质数索引中有质数位，并且可以被m整除？

import math

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            return False
    return True

def count_numbers(n, m):
    count = 0
    for i in range(10**(n-1), 10**n):
        digits = [int(d) for d in str(i)]
        prime_indices = [j for j in range(1, n+1) if is_prime(j)]
        prime_digits = [digits[j-1] for j in prime_indices]
        if len(prime_digits) > 0 and i % m == 0:
            count += 1
    return count

n = int(input("请输入n的值："))
m = int(input("请输入m的值："))

result = count_numbers(n, m)
print("满足条件的数字个数为：", result)