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, 25, ['R', 'g', '5585', '1059', '3917', '8711', 'K', 'C', 'o', '4587', '7493', 'P', 'B', '5951', 'd', 'b', 'B', '851', 'S', '4589', 'P', '1471', 'Z', 'x', '9477']
[EX A]: 53691

[EX Q]: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']
[EX A]: 6095

[EX Q]: 4, 19, ['9311', '5869', 'b', 'X', 'k', '4891', 'g', '7581', '8079', 'O', 'L', 'a', '9667', '2533', 'O', 'N', '1561', 'P', 'g', 'y']
[EX A]:
34312