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: 12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']
Example Output: 655

Example Input: 12, 14, ['7771', '4961', '7083', 'I', '8085', 'R', '8931', 'W', '9367', '6021', 'K', '3197', 'T', 'p']
Example Output:
3197