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:
[[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]

Ex Output:
[-17, -31, 56, 64]


Ex Input:
[[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

Ex Output:
[96, 48, 65, 19, -26, 95, -11]


Ex Input:
[[1, -174, 61], [-56, -140, 57], [100, -66, -24, -71, 75, -109, 75], [-56, 67, 66, -119, -175, -78, -54], [-27, -42], [-30, 21], [15, -67, -99, -98, 25, -179]]

Ex Output:

[61, 57, 100, 67, -27, 21, 25]