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: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']

Output: 0


Input: Consider Input: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']

Output: 1937


Input: Consider Input: 6, 8, ['2301', '1673', 'J', '3827', 'l', '7257', 'c', '6675', '5145', 'l', 'L', '9309', '3115', '9629', 'u', '7927', '5349', '2573', 'S', 'e', 'O', 'W', '4135', 'o', '4219', 'm', '7387']


Output: 13932