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]: 6, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']
[EX A]: 49687

[EX Q]: 3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']
[EX A]: 9392

[EX Q]: 5, 9, ['J', '1121', 'J', 'G', 'q', 'N', 'W', '6279', 'R']
[EX A]:
6279