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.

[EX Q]: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
[EX A]: 4866

[EX Q]: 1, 3, ['Z', 'X', 't']
[EX A]: 0

[EX Q]: 8, 10, ['8043', '7581', '5115', 'a', 'z', '8215', '3297', '4783', '6833', '815']
[EX A]:
12431