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: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']

Output: 10058


Input: Consider Input: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']

Output: 9511


Input: Consider Input: 1, 12, ['537', 'p', '4283', '1451', 'E', '4745', '817', '8435', 'p', '9215', '8571', '7019', 'q', 'n', '853', 'x', '9437', 't', 'm', '7341', 'W', 'I', 'H']


Output: 45073