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.

Example Input: 1, 10, ['N', 'p', 'z', '6083', 'x', 'x', '3063', 'Y', '7099', '9961', 'k', '7365', 'e', '8629', '9595', '2831', '3649', '3809', 'm']
Example Output: 26206

Example Input: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']
Example Output: 5121

Example Input: 17, 24, ['o', '1825', 'g', '7843', 'p', 'e', '2027', 'u', '5183', 'd', 'v', 'U', '8377', 'D', 'd', '8703', 'M', 'H', 's', 'B', 'j', '7243', 'e', '7641', 'Z', '8651', '3717', 'Q', 'n']
Example Output:
14884