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: 7, 12, ['3713', 'N', '7191', '73', '4595', '6537', 'H', 'v', 'H', '8531', 'k', 'H', 's', 'x', 'R', 'd', '507', 'C', '9649', '8875', '7931']

Output: 8531


Input: Consider Input: 4, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']

Output: 32351


Input: Consider Input: 12, 15, ['D', '3939', '3811', '7687', 's', 'j', '2127', 'P', 'H', '7207', '7039', '6351', 'g', 'T', 'R', '4045', '2551', '1139', 'W', '3417', '4659', 'K', '4525', '7121', 'n', '9527', 'X']


Output: 6351