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.

Input: Consider Input: 1, 4, ['o', 'O', '7355', 'S', '2513', 'f', '4189']

Output: 7355


Input: Consider Input: 3, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']

Output: 9114


Input: Consider Input: 11, 25, ['2577', 'o', 't', 'M', '1807', 'N', 'f', '7343', 'w', '8463', 'U', '5143', 'r', 'c', '1917', 'z', 'U', 'S', '5465', '5773', '7693', 'I', '8535', 'x', 'd', '241']


Output: 34526