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.

[[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]
[40, 84, 55]

[[-58, -176, 95, -113, 67, -164], [97, 98, -87, 68], [57, 21, 86]]
[95, 98, 86]

[[-35, -21, 84, 48, 68], [-103, -38, 78, -9, -48, 23], [56, -85, 72, -57, -147, 80, -10], [-3, -66, -9, 22, 90], [54, 52, 8, -71, -100], [19, -72, -194, -139], [19, 17, -83, -17, -57], [-106, 35, -142, -144, 3], [-198, -176, -90, 59, -7]]

[84, 78, 80, 90, 54, 19, 19, 35, 59]