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]: 4, 8, ['3753', 'y', '417', 'B', 'g', 'D', 'L', '6175']
[EX A]: 6175

[EX Q]: 4, 10, ['1081', 'm', 'm', '489', '9481', '5741', '1049', 'p', 'd', '7785', 'm', '4905', '1343', 'A', '9931', 'C', 'v', 'l']
[EX A]: 24545

[EX Q]: 7, 10, ['R', 'T', '5205', 'X', 'w', '7819', '5081', 'Y', 'Y', 'p', '273', '4479']
[EX A]:
5081