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: 4, 4, ['2227', '1525', 'g', 'l', 'R']

Output: 0


Input: Consider Input: 3, 10, ['x', '5071', '6421', '5701', 'l', '5659', 'P', '7975', 'z', 'p', 'B', 'q', '1275', 'v', '6471', 'o', 'Q', 'F', '1845', '6063', '3277', '9039', '4209', '2869', '2293', '4517', '577', '3375']

Output: 25756


Input: Consider Input: 9, 15, ['U', '3451', 'm', '1905', 'Q', '2299', '8533', '7069', 's', '1309', '1617', '531', '857', 'F', 'p']


Output: 4314