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.

[[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]
[89, 47, 19, -36]

[[-76, -194, 15, 74], [-60, -20, 6], [-118, -40, 82], [-135, 13], [10, -24, -119, -62, -109], [0, 5]]
[74, 6, 82, 13, 10, 5]

[[-6, -103, -58], [46, 90, -67], [-61, -25, 14, -16, -128, -16, -44], [-110, -108, -76, -130, -136], [-11, -115, -129]]

[-6, 90, 14, -76, -11]