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.
[[-196, -196, 25, 40, -134], [-145, -61, -176, -9], [-19, -7, 45, -32, -80, -26, -152], [-25, -133], [-163, 24, -71, -184, -59, 54], [-22, -199, -146, -41, 76, 96], [-193, -160, -11]]