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: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
Example Output: 0

Example Input: 3, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']
Example Output: 719

Example Input: 9, 17, ['A', '8727', '2337', '4745', '1165', '2693', '5763', '4173', '7165', 'H', 'o', 'r', '9981', 't', '6131', 'y', '1883', '7797', '1347', '8193', 'H', 'u', '3379', 'h']
Example Output:
25160