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: 11, 16, ['3157', '9479', 'p', '551', '7723', 'I', 'E', 'L', '3983', 'J', '2037', 'q', '4041', 'U', 'n', 's']

Output: 6078


Input: Consider Input: 6, 9, ['7895', '3853', 's', '7', '1351', '5409', 'y', 'R', '329', 'l', 'v', '569', '8461', 'O', 'p', '2845']

Output: 5738


Input: Consider Input: 8, 17, ['K', '4325', '9111', '2201', 'B', '7785', '8727', 'N', '7787', '2169', 'S', '1531', 'S', '5499', 'Q', '8235', 'H', '735', '1547', 'y', 'F', '5361', '4605', '459']


Output: 25221