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, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']

Output: 9771


Input: Consider Input: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']

Output: 0


Input: Consider Input: 11, 18, ['o', '8835', 'u', 'r', 'W', 'M', '7393', 'L', 'f', '2167', 'A', '4353', '4829', '2529', 'j', '4465', 'd', 'v', 'j', 'Z', '5899', 'k']


Output: 16176