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, 15, ['9021', '2343', '1041', '131', '9027', 'Q', 'v', 'j', '9391', '653', 'p', 'L', '4653', '6163', 'H', 'x', 'N', 'u', 'f', 'L', '6035', 'C', '5355', 'e']

Output: 30018


Input: Consider Input: 2, 21, ['7753', '4315', '7527', 'R', 'W', 'a', '3983', 'w', 'F', '8967', 's', 'Y', 'D', 'I', '5305', '2535', 'u', '135', 'M', 'D', 'G', 't', 'r', 'g', 'W', 'V', '3461', 'P', 'T', 'd']

Output: 32767


Input: Consider Input: 6, 8, ['7931', 'N', 'D', 'Y', 'q', '4195', '1221', '295']


Output: 5711