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.
[[-149, -71, -112, -67], [-101, -141, 77, -180, -157, -62, 61], [-135, -143, -133, -12, 21, -185, -96], [-93, -52, -151, -39, 68], [59, -69, -59], [97, -42, 65], [-176, 18, -178, -93, -3]]