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: 3, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']
Example Output: 9114

Example Input: 9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']
Example Output: 8357

Example Input: 4, 10, ['6691', '5123', 'r', 'M', '8541', '1927', 'f', 't', 'W', 'F', 'o', 'Q', '6929', '4299', 'k', 'o', '1481', '3997', '293', 'i', '773', '7689', '289', 'k', 'F', 'E', 'n']
Example Output:
10468