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.
[[-119, 39, 38, 94], [-42, -65, -92, -107, -47, -169], [-28, -103, -84, -180], [-161, -76, -151], [-33, -24, 16, -64, -39], [68, -113, -162, -152, -103], [-85, -34, -38, 67, 46, 27]]