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: 5, 23, ['6187', 'j', '9129', 'n', 'D', '6181', 'H', 'c', 'V', 'w', '4481', '9115', '1067', 'H', 'a', '1421', '7129', 'S', 'D', '6027', '8845', '3827', 'L']

Output: 48093


Input: Consider Input: 1, 2, ['2333', '6101']

Output: 8434


Input: Consider Input: 7, 18, ['9697', '4297', 'd', 'k', 'P', 'r', 'y', 'x', 'l', 's', '5109', '3113', 'b', 'A', 'U', '5383', 'O', '1059']


Output: 14664