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.
[[-113, -157, -151, -54, -169, -18, 77], [-80, -85, 66, -6, -26], [68, -21, 76, -22, -167, -123, 39], [-174, -67, -197, -149, 65, -16], [-197, -109, -133, -39, 70], [-123, -71, -39], [-100, 81, 73, 38, -80], [67, -199], [-48, -59, -108, -139, 15, -197]]