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.
[[38, 35, 59, 61, -126, -116], [-45, 88, -191, -63, -5, -26, 28], [-111, -25, -188, -167], [74, -112, 35, 86], [-161, 40], [-18, -157, -24, 92, 59, -43], [-1, 60], [-6, -17, 5, -153, -99, 85]]