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.
Input: 10, 23, ['o', 'B', '319', '1443', 'U', 'R', 'r', 'n', 'v', 'x', '8363', '8951', '2479', 'o', 'S', '4503', 'T', '8581', '493', 'J', 'o', 'C', 'H']

33370