def solution(board, k):
    answer = 0
    
    for i in range(len(board)):
        for j in range(len(board[i])):
            if i+j <= k:
                answer+=board[i][j]
    return answer

def solution(intStrs, k, s, l):
    answer = []
    
    for i in range(len(intStrs)):
        tmp = ''
        for j in range(s, s+l):
            tmp += intStrs[i][j]
            if int(tmp) > k:
                answer.append(int(tmp))
    return answer