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.

2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
19229

4, 5, ['b', 'u', '5279', '6945', '6631']
13576

9, 22, ['5499', '2245', '6593', '8095', 'y', 'u', 'n', 'n', '7887', '6689', 'P', '7527', '4373', '2541', 'k', 'n', '2125', 'C', '3525', 'H', 'U', 'n', '9769']

34667