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]: 2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']
[EX A]: 9385

[EX Q]: 17, 21, ['7037', '9447', 'f', 'R', '1237', '5735', '1327', '1371', 'd', '3025', 'B', '9165', '3447', '6135', '3315', 'l', '8069', 'g', 'H', 'e', '4523', '3149', 'H', 'o', '3947']
[EX A]: 12592

[EX Q]: 5, 7, ['K', 'o', 'j', 'F', '7583', '5985', '7881', '183', 'J']
[EX A]:
21449