def check_kaprekar(num):
    square = str(num**2)
    for i in range(1, len(square)):
        a,b = int(square[:i]), int(square[i:])
        if a+b == num and a and b:
            return True
    return False

def find_kaprekar(start, end):
    return [n for n in range(start, end+1) if check_kaprekar(n)]

print(find_kaprekar(2, 100))
print(find_kaprekar(101, 9000))