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: 17, 22, ['4123', '6299', '2781', '759', 'f', 'A', 'X', '2549', 'K', '8119', '8725', 'e', 'I', 'S', '1429', 'd', '8051', 'Q', 'y', '1045', '763', 't', 'J', 'J', '169', 'b', '721']

Output: 9859


Input: Consider Input: 4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']

Output: 25920


Input: Consider Input: 13, 26, ['3945', 'p', 's', '293', '5983', '6889', '7605', 'N', 'D', '1865', 'G', '9033', '2015', 't', '6019', '6349', '7575', '7981', '263', 'Z', '2493', '2179', '1581', '4167', '9839', '2891', 'A', '8903']


Output: 53352