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.
[[-8, -189, -115, -48, -174, -109, -38], [28, -161, 28, -111, 85, 81], [83, -134, -49, 70, -116], [-69, -66, -43, -161], [-12, -19, 47, 88, -133, -178], [-116, 89, -117, -36, -101], [-119, 82, 37, 81, -36], [-114, -109], [-76, -121, 7, -170, -39, 51]]