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: 4, 15, ['9021', '2343', '1041', '131', '9027', 'Q', 'v', 'j', '9391', '653', 'p', 'L', '4653', '6163', 'H', 'x', 'N', 'u', 'f', 'L', '6035', 'C', '5355', 'e']
Example Output: 30018

Example Input: 5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']
Example Output: 7356

Example Input: 4, 23, ['309', '8447', 'u', 'G', '2417', 'V', 'G', 'k', 'a', '6869', '6307', 'q', 'T', 'j', '1217', '6099', 'K', '2843', '7465', '1643', '5317', '1893', '9839', '1707', 'K', 'y', '9481']
Example Output:
51909