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.

Input: Consider Input: [[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]

Output: [64, 19, 84, 40, 78]


Input: Consider Input: [[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]

Output: [21, 70, 64, 38, 64, -27]


Input: Consider Input: [[-184, -114], [-194, -81, -101, -119], [100, -138, -121, 51], [-66, -148, -77, 82, -66, -51, -169], [-109, 21], [-150, -29, -140, -89, 5], [-144, 42, 22], [58, 2, -197, -137, -59, 6, 1]]


Output: [-114, -81, 100, 82, 21, 5, 42, 58]