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: 3, 6, ['x', '7739', '1923', '5829', '2215', 'M', '1901', 'A', '1585', 'W', '2433', '8947', '2217', '7879', 'i', '8543', '7457']

Output: 9967


Input: Consider Input: 4, 13, ['5653', '9869', '5325', '7307', '5513', '2167', '2393', 'p', 'F', '2011', '5431', '2695', 'v', 'p', '3743', 'j', 'y', '5903', '5135', '467', '8443', 'C', 'i', 'w', 'y']

Output: 27517


Input: Consider Input: 15, 27, ['3335', '2387', '381', 'u', '8825', 'K', 'F', '3177', 'P', '4777', '285', '3713', 'A', '511', 'f', 'Z', '981', 'm', '1761', '8331', 'T', '2931', 'f', 'i', '9121', 'q', '7393']


Output: 30518