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.
[[98, 62, -166, -178, 46], [-27, -122, -31, -61, 97, -61], [-190, 27, 49, 16, -176], [-3, -149, 66, -155, 27, 39, 84], [-82, 65, 53, 50], [69, -152, -96, 54, -92, 73, -10], [-159, -194, 78, -112, -191, -151, -129], [-23, -142, 74]]