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: 5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']

Output: 7356


Input: Consider Input: 1, 2, ['1811', 'K', '3343', 'e']

Output: 1811


Input: Consider Input: 6, 24, ['1725', 'e', '9697', 'D', 'a', 'j', '8817', '2225', '3007', '3459', 'Z', 'y', 'y', '8755', '997', '117', 'R', '2981', '1875', '245', '6185', '2463', 'b', 'v', '1581', '7471', '7845', 'i', 'y', '1913']


Output: 41126