{
status: 'Success',
method: 'server',
maindata: '26bb71721325648886111d964013e99dda11cf636503afa4ec4a29a6c3dc08ae009d875b430f3cd6767a94198b3f843d8fd7a50091c33d801c924d34e6310c3f6ec10ddea33c70e42fd924c557622f126b14de62c6960f1c051efb1326eafca4dd4e5f0e1a15ecdc25c60f89cbe21d7b140c80fcd7da5ce34b73dbef26d11341',
otherdata: [

directions = {
"up": lambda row, col: (row - 1, col),
"down": lambda row, col: (row + 1, col),
"left": lambda row, col: (row, col - 1),
"right": lambda row, col: (row, col + 1),

def find_my_cooridnates(r, c, mtrx):
for row in range(r):
for col in range(c):
if mtrx[row][col] == "B":
return [row, col]

#include <iostream>
#include <vector>
using namespace std;
const int ALPHABET_SIZE = 26;
struct node {

def move_up(row, col):
return row - 1, col


def move_down(row, col):

#include <iostream>
#include <vector>
using namespace std;
const int ALPHABET_SIZE = 26;
struct node {

def find_my_cooridnates(r, c, mtrx):
for row in range(r):
for col in range(c):
if mtrx[row][col] == "B":
return [row, col]

from collections import deque

time = deque(int(x) for x in input().split())
tasks = [int(x) for x in input().split()]

def make_a_move(row_, col_, matrix):
found_hazelnuts = 0
if not (0 <= row_ < len(matrix) and 0 <= col_ < len(matrix)):
print("The squirrel is out of the field.")
return

def make_a_move(row_, col_, matrix):
found_hazelnuts = 0
if not (0 <= row_ < len(matrix) and 0 <= col_ < len(matrix)):
print("The squirrel is out of the field.")
return