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.
[[9, -115, 77, 35, 28, 44], [-156, -183], [-9, 30, 34], [-160, -141, -53], [-142, -80, -90, -77, -109, -27, 17]]