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: 10, 16, ['V', 'b', '2575', '385', 'U', 'I', 'Y', '2647', 'V', 'k', '6379', 'W', '1883', 'n', 'K', '3001', '6791', 'I', '4285', 'f', 'i']

Output: 11263


Input: Consider Input: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']

Output: 0


Input: Consider Input: 9, 9, ['3011', 'F', '4655', '7785', 'e', '91', '3889', 's', 'l', '3235', 'H', 'D', '9675', 't', 'K', '9923']


Output: 0