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.

[[77, 52], [-25, -37, 13, 77, 88, -15, -158], [60, 86, -7], [78, 7, -132], [99, -94, -185, -158], [34, -90, 83, -81], [-21, -63, -161, 47, 12, 95], [59, 29], [-45, -57, 96, -170, 76, -70]]
[77, 88, 86, 78, 99, 83, 95, 59, 96]

[[-45, 100, 36, -80, 90], [-117, 80, -105, 86], [45, -168, -148, 87, -195, -102]]
[100, 86, 87]

[[-198, -111, -92, 42, 42], [-15, 69, -160, 78, 36], [-189, 44], [-67, -174, -38, -43, 100], [-79, -170, 93, -36, -51, -133, 39], [55, -172, 74, -185, -96, 48], [-171, -112, -97, -172, 38, 13, 100], [-25, -66, -15, 40, -5, -103], [11, -154, -96]]

[42, 78, 44, 100, 93, 74, 100, 40, 11]