数素数

def solve(m, n):
    def is_prime(x):
        if x < 2:
            return False
        for i in range(2, int(x**0.5) + 1):
            if x % i == 0:
                return False
        return True
    primes = []
    num = 2
    while len(primes) < n:
        if is_prime(num):
            primes.append(num)
        num += 1
    result = primes[m-1:n]
    for i in range(0, len(result), 10):
        print(' '.join(map(str, result[i:i+10])))