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.

[[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]
[34, 17, 30, -1, 5, 37, 24, 81]

[[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]
[-15, 88, -15, -85]

[[11, 5, -45, -126, -175, -69, -44], [55, 23, -107], [-13, -21, -144, -108, -81]]

[11, 55, -13]