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]: 12, 24, ['3749', 'r', '9823', 'Y', 'K', 'V', 'q', 'H', '3273', '3091', '9531', 'E', '2219', '3101', 'P', 'k', 'r', 'a', 'T', 'I', 'j', 'i', '4045', 'K', 'r']
[EX A]: 9365

[EX Q]: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']
[EX A]: 0

[EX Q]: 7, 10, ['N', 'r', 'P', '5707', '1017', 'P', 'j', 'W', '217', '1313', 'o', 'R', '8511', 'n', 'N', 'Y', 'r', 'w', 'K', 'H']
[EX A]:
1530