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: 11, 20, ['7193', 't', 'v', '6817', '3505', 'u', '6051', '4027', 'G', '8381', 'Z', 'T', 'q', 'M', 'o', '7645', '75', 'J', 'U', 'N', '3885', 'y', 'C', 'q', '5109', 'f', 'v']
Example Output: 7720

Example Input: 1, 2, ['4857', '6373']
Example Output: 11230

Example Input: 17, 17, ['C', '2251', '7747', 'p', '7049', '5807', 'C', 'P', '6669', 'e', '8425', '3251', '6989', '4409', '2213', '3701', '1529', '8823', 'e', 'W']
Example Output:
1529