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: 2, 3, ['3335', '3451', 'f', 'M']

Output: 3451


Input: Consider Input: 6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']

Output: 21079


Input: Consider Input: 18, 19, ['h', 'R', 'Z', 'f', '4661', '3241', 'y', 'H', '425', 'T', '5249', '4849', 'g', 'V', 'b', '3367', '243', '1319', '9559', 'P', 'v', '4221', '2071', '6755', '2011', '5613', '6793', '7139', '2973']


Output: 10878