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, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']

Output: 719


Input: Consider Input: 2, 15, ['l', '5597', 'M', 'l', '6065', '7949', 'e', '433', '8159', 'N', 'Z', '5597', 's', 'k', '6973', '8387', 'n', 'W', '9895']

Output: 40773


Input: Consider Input: 11, 11, ['d', 'Q', '5479', '919', '3929', '9351', '9665', '655', 'L', '6785', '2263', 'g', '5513', '9491', '1805', '9573', '6043', '2763', '8055', 'A', '6687', 'c', '7649', 'J']


Output: 2263