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: 12, 15, ['I', 'H', '3483', '6289', 'X', '5705', '7707', 'x', 'J', 'c', '5161', '9653', '3949', 'l', 'b', 'C', 's', '17', 'a', '4231', 't']

Output: 13602


Input: Consider Input: 2, 3, ['f', 'C', 'f', 'V', 't', 'x']

Output: 0


Input: Consider Input: 11, 15, ['9455', '8139', 'F', 'w', '9631', '669', 'X', '17', 'u', '6341', 'C', 'M', 'c', 'Y', 'n', 'g', 't', 'H', 'J', '3995', '7415', 'x', '715', 'F']


Output: 0