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, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]

Ex Output:
[75, 95, 70, 68, 100, -2, 15, 32, 97]


Ex Input:
[[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]

Ex Output:
[57, 80, -20, -50, 8, 64]


Ex Input:
[[64, 36, -180, 75, -124, -36, 78], [66, -22, -159, -55], [89, -106, 72, -42, -142, -39, -8], [-120, -42, -94, -5, -53, 36, 18], [30, -190, -197, -53, -67], [-66, -115, 100, -128]]

Ex Output:

[78, 66, 89, 36, 30, 100]