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: 1, 3, ['e', '1703', 'x', 'U', '873']

Output: 1703


Input: Consider Input: 3, 14, ['Y', '9099', 'H', 'D', 'M', '1111', 'N', '4939', 'b', 'Y', '13', 'L', 'J', '4045', '2005', 'F', 'O', '1495', 'J', 'h', 'G']

Output: 10108


Input: Consider Input: 13, 16, ['r', 'B', 'P', 'Z', '9149', '4011', '1703', '1817', '329', 'B', '1241', 'u', '3077', '1959', 'Y', 'A', '707', '6941', '9569', '7399', 'e', 'x', 'e', 'M', '9001', 'y', '3863', '9799']


Output: 5036