code: def primeSieve(k):
      
  
      def isPrime(n):
          """return True is given number n is absolutely prime,
          return False is otherwise."""
          for i in range(2, int(n ** 0.5) + 1):
              if n % i == 0:
                  return False
          return True
      result = [-1] * (k + 1)
      for i in range(2, int(k + 1)):
          if isPrime(i):
              result[i] = 1
          else:
              result[i] = 0
      return result
docs: return a list with length k + 1, showing if list[i] == 1, i is a prime
      else if list[i] == 0, i is a composite, if list[i] == -1, not defined