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: 25, 26, ['9367', 'G', 'c', '4997', 'g', 'r', '2893', 'T', '6693', 'I', '5127', 'N', '4333', '6905', '8539', 't', 'y', 'f', '8341', 'e', 'g', '8749', '3525', 'g', '6263', '321']

Output: 6584


Input: Consider Input: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']

Output: 203


Input: Consider Input: 3, 16, ['4263', 'H', 'n', 'S', '8969', 'q', '9613', 'E', '1883', '7543', 'z', '7153', 'F', '657', 'h', 'C', 'm', '1217', 'Z', '8105', '6569', 'V', '8959', 'N', 'F', '1275', 'H', '9829', '8633']


Output: 35818