Let's play a game of hide and seek. You have been given a map of 10x10 cells and in one of the cells we've hidden your goal.
You can move to and from any cell in the field.
On each move you'll get informed if the move places you closer or further away from your goal, compared to your previous location.
Your function compiles data about previous steps, each step is a list of list, where first and second elements are
your coordinates (row and column) and third is the info on how much closer you've gotten (colder or warmer) -- "colder" is -1, "warmer" is 1 and "same" is 0.
For your measurement of the distance to the goal you should use the Euclidean distance. At each step you need to return the coordinates for your next step.
If your step places you within the goal cell, then you win! You should find the goal within **12** steps.

**Input: ** Information about previous steps as a list of lists.
Each list contains coordinates and status alteration (warm, cold same).

**Output: ** The coordinates of your new move as a list/tuple of two integers.

**Example:**

checkio([[2, 2, 0]]) # [0, 2] checkio([[2, 2, 0], [0, 2, -1]]) # [3, 2] checkio([[2, 2, 0], [0, 2, -1], [3, 2, 1]]) # [4, 1] checkio([[2, 2, 0], [0, 2, -1], [3, 2, 1], [4, 1, 0]]) # [3, 1]

**How it is used:**
Use this concept to find something with indirect data such as a beeping sound (like a metal detector or rad counter).
This is a prediction problem and you can use it in machine learning.

**Precondition:**
|map| = 10x10