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, 1, ['f', '6023', 'A', 'f', '4665', 'u', 'o', '7783', 'a', 'N', 'd', '7685', 'W', '9631', 'e', 'W', '1625', 'Q', 'B', '9097', '7613', 'L', '9929', '8469']
[EX A]: 0

[EX Q]: 1, 4, ['H', 'V', 'w', '4621', 'C', '3763', '1271', '967']
[EX A]: 4621

[EX Q]: 3, 15, ['B', '1459', 'V', 'v', '9355', '9237', 'K', 'g', 'x', 'q', 'j', 'J', '8291', '3165', '2911', '3349']
[EX A]:
32959