input: from typing import List
  
  def fibonacci(n: int) -> int:
      """ Generate the nth Fibonacci number using a recursive approach. The function should
      return 1 for n == 1 or n == 2, and for any other value of n, it should return the sum
      of the previous two Fibonacci numbers (i.e., fibonacci(n-1) + fibonacci(n-2)).
      >>> fibonacci(1)
      1
      >>> fibonacci(2)
      1
      >>> fibonacci(10)
      55
      """
output:     if n == 1 or n == 2:
          return 1
      else:
          return fibonacci(n-1) + fibonacci(n-2)