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, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']

Output: 0


Input: Consider Input: 6, 18, ['5051', 'g', 'C', 'p', 'O', 'i', 'E', '4947', '5345', '8453', '4967', '3749', 'F', 'P', '5045', 'o', '5605', 'H', '9319', '5471', 'F', 'B', 't', 'H']

Output: 38111


Input: Consider Input: 4, 6, ['6429', '3071', 'P', 'e', 'P', '1309', '5895']


Output: 1309