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]: 15, 21, ['w', 'R', '9247', '5745', '5397', 'U', 'R', 'e', '8067', 'e', '2851', 'O', 'F', '4705', '5393', 'q', 'b', 'J', '211', '4319', 'o', 'h', 'Z', '4423', 'j', '2691', 'U']
[EX A]: 9923

[EX Q]: 1, 5, ['5033', '343', 'g', 'q', 'D', '4011', 'Z', '7925', '4297', '1155', '3967', 'e', 'E', 'c', 'I', 'B', '4985', 'B', 'i', '4707', '7205', 'M', 's', 'i', '5121', 'p']
[EX A]: 5376

[EX Q]: 1, 12, ['r', '1295', 'J', 'K', '613', 'b', '4383', 'c', '3487', '5727', '6485', '2987']
[EX A]:
24977