def is_prime(num):
    if num == 1:
        return False
    if num == 2:
        return True
    if num > 2:
        # check for factors
        for i in range(2, num):
            if (num % i) == 0:
                return False

        return True

    # if input number is less than
    # or equal to 1, it is not prime
    else:
        return True


def primeRemover(tri, m, n):
    for i in range(0, m+1):
        for j in range(0, n+1):
            if is_prime(tri[i][j]):
                tri[i][j] = 0
    print(tri)
    return tri