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]: 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']
[EX A]: 0

[EX Q]: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']
[EX A]: 59155

[EX Q]: 4, 16, ['x', 'c', 'y', 'm', '9393', '5715', 'm', 'F', '2881', 'p', 'T', '7077', 'L', '6777', 'N', '8927']
[EX A]:
40770