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.

[[79, 50], [90, 81, -105]]
[79, 90]

[[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]]
[75, 95, 70, 68, 100, -2, 15, 32, 97]

[[-84, 43], [-50, 30], [13, 62], [-76, -42, -23, -144, 3, -63], [-178, -154, -158], [-27, -154, -119, 58, 5, 40], [70, -59, 68, 12, -101, -126], [6, 3, 42]]

[43, 30, 62, 3, -154, 58, 70, 42]