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.

Ex Input:
[[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]

Ex Output:
[75, 5, 96, 58, 93, -49, -5, 82, 92]


Ex Input:
[[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]

Ex Output:
[93, 57, 98, 60, 15, -64, -9]


Ex Input:
[[-119, 39, 38, 94], [-42, -65, -92, -107, -47, -169], [-28, -103, -84, -180], [-161, -76, -151], [-33, -24, 16, -64, -39], [68, -113, -162, -152, -103], [-85, -34, -38, 67, 46, 27]]

Ex Output:

[94, -42, -28, -76, 16, 68, 67]