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:
[[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

Ex Output:
[60, 26, 61, 74, -28]


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:
[[0, -145, -56, 36, 78], [98, 67, 72, 96], [-190, 73, -199, -22], [-102, 59, -107, -181], [70, -106, 71], [49, -140, -160, -139], [-136, 84, 75, -93, -13], [-137, -171, 6, -9]]

Ex Output:

[78, 98, 73, 59, 71, 49, 84, 6]