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, 1, ['D', 'W', '5783']

Output: 0


Input: Consider Input: 5, 12, ['1699', '6521', '1705', '8871', 'C', '8963', '8657', 'E', '2693', 'e', 'S', 'a', 'M', '289', '6037', '2663', 'w', 'e', 'X', '2973', 'j', 'f', '1609', '2759', 'P', 'l', 'k', '4463']

Output: 20313


Input: Consider Input: 1, 14, ['9625', '673', 'u', '8309', 'b', '7645', '6655', '9685', '1959', 'H', 'n', '503', '2169', '6919', 'K', '5749', '3675', '3717']


Output: 54142