In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[12, 56], [48, -4, -61, -81, 10, -163, -109], [-72, -14, 16, 24], [-30, 79, -78, 84, 98], [11, -14, 45, -52, -52], [-12, 33, 55, -29], [-83, -65, -63], [-83, -92, -36]]