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.
[[88, 37, -26, -185, -36, 8, -105], [99, -150, -165], [90, -170, -94, 91], [44, -198, -29, -135, -36], [-45, -17, -174, 99, -119, -164], [-73, -14], [-126, -19, 27, -119, -62], [35, 11, -18, -90], [-145, -127, 86, 7, -49, -95, -168]]