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]: 21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']
[EX A]: 20962

[EX Q]: 1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']
[EX A]: 24200

[EX Q]: 4, 5, ['g', 'C', 'd', 'e', 'E', '9575']
[EX A]:
0