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.
[[36, 69, -9, 74], [-30, -109, -191, -183, 32], [-164, -76, -168, -55, 17], [-35, -101], [-108, -139, -135, -140, 2, -96], [-170, 74, -30, -39], [-87, 56, -119, -176, -57, -182]]