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.
[[20, -168, 32, -200], [-26, 41, -22, -110, -33], [-81, -56, -2, 16, -17, -191], [-50, 82, -43, 56, 84], [48, 98, -143, 76, -53], [-101, -139, 24, -163, 91, 93], [-153, 41, 59], [-17, 21, -49, 97, 68, -182]]