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.

4, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']
13650

8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']
1930

7, 18, ['M', 'g', 'Y', 'G', 'q', '8451', '2277', 'i', 'H', 'K', 'b', '1325', 'X', '807', 'F', 'M', '3559', 'L', 'x', '6683', 'I', '4803', '2625', 'L', 'A', 'x', 'G', '4129', '4981', 't']

7968

