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, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']
Example Output: 123

Example Input: 3, 4, ['1809', '1127', 'm', '3137']
Example Output: 3137

Example Input: 11, 18, ['4227', '5141', '2299', '6757', '669', 'A', 'S', '8641', 'a', 'Q', '5665', '5205', 'p', 'r', 'V', '2397', 'V', '4687', '1925', 'a', '6397', '691', '113', '5357', '9563', '6071', '7287', '2947']
Example Output:
17954