input: from typing import List
  
  def maximum_revenue(weights: List[int], values: List[int]) -> int:
      """ Calculate the maximum possible revenue from the items with given weights and values.
      
      >>> maximum_revenue([2, 1, 3], [4, 2, 3])
      7
      >>> maximum_revenue([1, 2, 3], [6, 10, 12])
      22
      """
      n = len(weights)
      W = 5  # total capacity of knapsack
      K = [[0 for x in range(W + 1)] for x in range(n + 1)]
  
      for i in range(n + 1):
          for w in range(W + 1):
              if i == 0 or w == 0:
                  K[i][w] = 0
              elif weights[i - 1] <= w:
                  K[i][w] = max(values[i - 1] + K[i - 1][w - weights[i - 1]], K[i - 1][w])
              else:
                  K[i][w] = K[i - 1][w]
  
      return K[n][W]
output:     n = len(weights)
      W = 5  # total capacity of knapsack
      K = [[0 for x in range(W + 1)] for x in range(n + 1)]
  
      for i in range(n + 1):
          for w in range(W + 1):
              if i == 0 or w == 0:
                  K[i][w] = 0
              elif weights[i - 1] <= w:
                  K[i][w] = max(values[i - 1] + K[i - 1][w - weights[i - 1]], K[i - 1][w])
              else:
                  K[i][w] = K[i - 1][w]
  
      return K[n][W]