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: 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: 4, 28, ['4857', '1273', 'C', '687', 'p', '9315', '1813', 'f', '9233', '6239', '4855', '2569', 'G', '2329', 'V', '5559', '9067', 'g', '567', 'm', 'Q', '3405', '9909', '2847', 'n', 'z', '1133', 'A', '7641', '3513']


Output: 69527