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.
[[22, 67, -10, -162, -18, -81, 89], [-20, 21, 79, -50, 52, -44, 55], [-65, -168, -51], [-180, -45, -145, -136, -115, -143, -41], [-143, -93, 55, 67, -131, -145, -85], [0, 48, -154, -160, -124, -37], [-20, -185, -34, -196, -154]]