In this task you will be given a list of dictionaries. A dictionary is a set of key-value pairs, where each key is unique and has a value associated with that key. You should sort the list of dictionaries from smallest to largest by their 'first' key. If there is two dictionaries with the same 'first' value then sort them by their 'second' key. Negative numbers should come before positive numbers.

[Q]: [{'first': -14, 'second': 51}, {'first': 30, 'second': 90}, {'first': -66, 'second': 39}, {'first': -38, 'second': 12}, {'first': 51, 'second': 59}]
[A]: [{'first': -66, 'second': 39}, {'first': -38, 'second': 12}, {'first': -14, 'second': 51}, {'first': 30, 'second': 90}, {'first': 51, 'second': 59}]


[Q]: [{'first': -67, 'second': 39}, {'first': 65, 'second': -26}, {'first': 6, 'second': -11}, {'first': -90, 'second': -83}, {'first': -46, 'second': -94}, {'first': -1, 'second': -82}, {'first': 29, 'second': -14}, {'first': 24, 'second': 68}]
[A]: [{'first': -90, 'second': -83}, {'first': -67, 'second': 39}, {'first': -46, 'second': -94}, {'first': -1, 'second': -82}, {'first': 6, 'second': -11}, {'first': 24, 'second': 68}, {'first': 29, 'second': -14}, {'first': 65, 'second': -26}]


[Q]: [{'first': -49, 'second': 66}, {'first': -93, 'second': 22}]
[A]:
first: -93
second: 22
first: -49
second: 66