TASK DEFINITION: In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
PROBLEM: 7, 19, ['8309', 'O', '1491', 'k', '2521', '1161', 'y', '3215', '8345', '1949', '9883', 'g', 'z', 'B', 'S', 'j', 't', '2841', 'j', '3333', 'S', 'w', '2283', '793', 'w', 'q', 'p', 'J', '7979']

SOLUTION: 26233

PROBLEM: 4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']

SOLUTION: 25920

PROBLEM: 9, 12, ['6007', '7709', 'o', 'G', 'D', '1431', '7085', '7881', '3843', 'u', '3387', 'x', 'Y']

SOLUTION:
7230