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.
[[26, 62, -94, -16, 39], [-17, -176, 15, -82, -161, -134], [-32, 76, 99, -198, -64], [-119, -168, 11, 43, 81, 27, -87], [-68, 23, 22, -103, -69, 79, -13], [-115, -32, -58, 5], [-86, 13, -160, 85, 4], [-198, -179, -78, -91, -162, 90]]