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.

[[-61, -44, -78, -169, 47, -84, -59], [-160, -114, -11, -9], [6, -104, -47, 76], [-118, 22, -171, 8, 27, -42], [25, -74, 45, -171, -64, -157, -112], [-1, -17, -46, -19, 26], [-11, -75, -166, -127, -34, -141], [85, -121, -101, 51, -41, 58, -139], [-122, 67, -116, 13]]
[47, -9, 76, 27, 45, 26, -11, 85, 67]