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.

[[-80, -194], [-27, -106, -119], [-185, -153, -114]]
[-80, -27, -114]

[[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]
[74, 78, -132, 63, 73, 39]

[[-57, 66, -17, -10], [45, -72, -44, -112, -6, 53, -35], [-45, -29], [-13, -181, -89]]

[66, 53, -29, -13]