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.

[[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]
[-26, 0, 75]

[[72, -19, -46, -126], [0, 47, 52, -113, -37, -16, -81], [82, -7, 2, 84, 38], [-178, -84, 84, 14, -123]]
[72, 52, 84, 84]

[[-48, -158, 0, -16, -133], [-98, 94, -17, 37], [-110, -167, 72, 8, 83, -10, 97], [-126, -183, -7, -195, -12, 23]]

[0, 94, 97, 23]