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, 10, ['C', '6511', 'S', '5389', '5679', 'O', 'Z', 'm', 'p', '1135', '7887', '6407', '6561']

Output: 12203


Input: Consider Input: 11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']

Output: 4918


Input: Consider Input: 5, 9, ['5909', 'x', 'Q', '5923', 'v', '2743', 'G', 'S', '8085', '7987', 'z', 'g', '4309', 'T', 'Q', 'X', 'M', '73', 'k', 'z', 'P', '6147', '7421', '9537']


Output: 10828