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: 2, 3, ['h', 'w', '3397']
Example Output: 3397

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: 3, 23, ['9359', '2255', 'a', '6285', 's', 'k', '3647', 'A', '9733', 'f', 'V', 'C', '5523', '5667', 'L', 'V', 'n', 'I', 'o', '455', 'Z', 'n', '8201', 'b', '4001', '3573', '9461']
Example Output:
39511