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:
[[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

Ex Output:
[-55, 98, -27]


Ex Input:
[[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]

Ex Output:
[9, -5, 62, -35, 92, -30, 91]


Ex Input:
[[5, -85, -159, -30, 20, 56], [-72, -103, 7, -191, -160, 9, 77], [-153, -125, -15, -9, -161, -198, -146], [-145, 99, -64, -55, -197, -158, -7], [69, -104, -84, 84, -129, -4], [-109, -30, -159], [80, -25, -101, 60], [-115, -160, 19, -18, 55, -12]]

Ex Output:

[56, 77, -9, 99, 84, -30, 80, 55]