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, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']

Output: 34470


Input: Consider Input: 1, 3, ['x', '971', '3029']

Output: 4000


Input: Consider Input: 4, 9, ['3', 'k', 'C', 'i', 'W', 'E', '7837', '7901', 'z', 'H', '4095', 'q', 'Y', '4289', '7703', 'x', '7437', '9693', '7763']


Output: 15738