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, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']
[EX A]: 15701

[EX Q]: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
[EX A]: 14032

[EX Q]: 1, 1, ['G', '3133', '2303', 'p', '473', '7583', 'Z', '9753', '595', '6567', 'w', '1811', 's', '7863', '4807', '6749', 'b', 'n', 'f']
[EX A]:
0