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: 2, 8, ['4225', 'k', '4097', '4459', '8125', '431', '495', 'Z']

Output: 17607


Input: Consider Input: 3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']

Output: 9392


Input: Consider Input: 3, 16, ['w', '4867', 'i', '8121', 'K', '5221', 'Y', 'H', '6729', '9291', '5843', '1867', '4413', '5197', 'c', '8239', '5997', 'E', '205', 'o', '8503', 'l', '5149', '5893', '4237', 'i', '2949', 'F']


Output: 54921