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.

[Q]: 9, 12, ['8515', '4987', '7905', 'K', 'u', '2791', 'o', '8955', 'j', 'x', 'e', 'Z', '6231', '4913', '7933', '4079', '2945', '475', '6415', 'V', '8767', 't', 'c', '919', 'M', '5501', 'y', 'S', 'L', 'Q']
[A]: 0


[Q]: 2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
[A]: 19229


[Q]: 12, 13, ['p', '5691', 'R', 'T', '7527', 'e', 't', '4455', 'Q', '1099', 'I', 'W', 'd']
[A]:
0