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: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

Output: 10176


Input: Consider Input: 1, 1, ['d', '6481']

Output: 0


Input: Consider Input: 12, 23, ['S', 'g', 'C', 'V', 'w', '3893', '4625', '3083', 'v', '1983', '6897', 'A', '6515', 'm', '1105', 't', 'R', 'S', '8167', 'y', '407', '9761', '4047']


Output: 30002