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.

[[35, -101, 13, 4, -151, 87], [50, 52, -34, -161], [-184, -19, -4, -152], [82, 30, -168, -115, -193, -139], [12, -97, -193]]
[87, 52, -4, 82, 12]

[[-45, -38], [-74, -64, -89], [-113, 74, 59, -86], [28, 57, -77, -99, 95], [-193, -88, -89, 85]]
[-38, -64, 74, 95, 85]

[[-123, 34, -21, -136, -170, -170, -197], [36, 1, 9, -134, 79, -158], [-129, -93, -13], [93, -16, -160, 37, 25], [44, 59, -108], [82, -113]]

[34, 79, -13, 93, 59, 82]