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]: 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]: 6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']
[EX A]: 21079

[EX Q]: 3, 11, ['l', 'E', 'y', 'J', 'L', 'c', 'o', '9853', 'V', '1975', 'u', 'r', 'a', 'U', '7201', '6705', 'f', '1243', '4719', '6121', '1219']
[EX A]:
11828