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, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']
[EX A]: 22271

[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]: 9, 15, ['l', '6575', 'H', '5403', 'c', 'M', '1971', '461', '4287', '4895', 'a', 'U', '2663', '2811', '4579']
[EX A]:
19235