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: 10, 22, ['4049', '2745', 'g', 'T', 'N', 'u', 'Q', '3687', '5871', 'i', '9139', '585', '8435', '5761', '5825', '5909', 'f', '6317', '8227', '4051', 'E', '5167', '6953', 'g', '4113', '2493']

Output: 59416


Input: Consider Input: 2, 3, ['h', 'w', '3397']

Output: 3397


Input: Consider Input: 19, 25, ['4069', 'I', '8203', '9015', 'O', 'z', 'T', '3979', '4897', 'w', 'N', '8579', '8525', 'g', '13', 'x', 'k', '2773', 'i', 'L', 'o', 'a', '9997', 'Z', 's', 'D', '4059', '5155', '731']


Output: 9997