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]: 20, 21, ['3975', '2459', 'X', '337', 'X', '5453', '9019', 'O', '4911', '1019', 'y', 'D', 'K', 'W', 'v', '2479', 'a', 'o', '4867', '9195', '3269']
[EX A]: 12464

[EX Q]: 14, 14, ['a', 'i', '5431', 'U', '9109', 'm', 'H', '7643', '127', 'a', 'S', '4285', '5625', '5479', '6409', 'U', 'n', 'R']
[EX A]: 5479

[EX Q]: 5, 6, ['2217', 'I', '7555', '4047', 'g', '7201', 'X', 'l', 'k', 'K', '4611', '6477', 'E', '6171']
[EX A]:
7201