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, 12, ['2735', '2057', '8217', '7745', 'p', '165', 'e', 'g', 'c', '2391', '523', 'R', '1009']
Example Output: 523

Example Input: 6, 9, ['8047', 'Q', 'A', '2811', '8953', 'P', '4515', 'f', 'K', 'u', 'g', 'R', 'p', '667', '8703', '2903', '6299', '417', '3317', 'O', 'z', '3507', '8969', '6193', '2549']
Example Output: 4515

Example Input: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']
Example Output:
11880