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: 4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']

Output: 22271


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: 19, 25, ['X', 'M', '3201', '145', 'b', 'R', '7557', '2039', 's', '8495', '3833', '4655', '8213', '5459', 'F', '2121', '8415', 'P', '5839', 'Z', '8569', 'u', 'o', '4055', '8377', '2311', 'p']


Output: 26840