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, 1, ['2821', '3823', '9741', 'k', 'X', '2457']

Output: 2821


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: 11, 23, ['4479', 'c', 'k', 'p', 'x', 'F', '4587', 'C', '6073', '6745', 'G', 'P', 'G', '4259', '7063', 'H', '6127', '7101', 'U', '3701', 'X', '5835', '8343', 'd', 'B', 'G', 'j']


Output: 42429