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, 3, ['o', 'p', '4765', 'u', '629', 'p']
[EX A]: 4765

[EX Q]: 24, 27, ['7541', '8415', '3387', 'J', 'U', '1485', 'p', 'c', 'b', 'O', 'm', '4993', '499', '3927', 'e', 'h', 'g', 'x', '5859', 'y', '2543', '1769', '4715', '8359', '9225', '5191', 'T', 'U', 'm', '6157']
[EX A]: 22775

[EX Q]: 13, 25, ['C', '675', 'v', '2455', '8371', '4285', '7879', 'X', 'n', 'c', '2833', 'r', 'r', 'n', 'e', '8963', 'j', '7667', 'c', '2639', 'Z', 'a', 'v', 'P', '4431', 'g']
[EX A]:
23700