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.

[[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
[86, 76, -100, 99, 27, -48]

[[54, -120, -69, 80, 56, -111, -19], [64, -158, -131, 32], [60, 26, -150, -14]]
[80, 64, 60]

[[-96, -163, 55], [-199, -2, 91], [-181, -82, -26, -67, -64, -85, 68], [-50, -26, -105]]

[55, 91, 68, -26]