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.
[[40, -138, -136], [41, -110, -168, -10, -85, 40], [-29, 52], [-20, -163, 60], [-23, -17, -41, -88, -96], [-167, 24], [-113, -61, -81, -95, -117, 90], [57, -166, -105, -85, -176, 81]]