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.
[[57, -79, -32, 19], [-168, -189], [35, -23, -56], [13, -194, -191, -102], [-90, -27, 90, -66, -16], [-121, 43, -188], [9, 34, 81, -62, -176, -185], [-112, -74, -101, -67], [-195, -98, -194, -113, -54]]