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: 21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']

Output: 20962


Input: Consider Input: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']

Output: 14032


Input: Consider Input: 1, 2, ['227', '8567', 'u', '2257', 'r', 'D', 'a']


Output: 8794