def treasure_hunt(matrix, m, n):
    res = []
    k, l = 0, 0
    while k < m and l < n:
        for i in range(l, n):
            res.append(matrix[k][i])
        k += 1
        for i in range(k, m):
            res.append(matrix[i][n - 1])
        n -= 1
        if k < m:
            for i in range(n - 1, l - 1, -1):
                res.append(matrix[m - 1][i])
            m -= 1
        if l < n:
            for i in range(m - 1, k - 1, -1):
                res.append(matrix[i][l])
            l += 1
    return res

# Test case 1
matrix = [
    [12, 31, 20, 50, 54],
    [53, 24, 32, 52, 65],
    [38, 10, 99, 1, 44],
    [1, 62, 89, 22, 39]
]
m = 4
n = 5
print(*treasure_hunt(matrix, m, n))

# Test case 2
matrix = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
]
m = 3
n = 3
print(*treasure_hunt(matrix, m, n))

L2 Hard