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, 6, ['m', 'q', '4069', '4487', 'c', '4639']

Output: 13195


Input: Consider Input: 2, 3, ['3335', '3451', 'f', 'M']

Output: 3451


Input: Consider Input: 9, 23, ['4609', '4215', '1075', 'L', '6597', '4115', '1371', '6337', 'V', 'Y', '4153', 'D', 'V', 'a', '8925', '7783', 'n', '7565', 'Z', '399', '5379', '377', '1077', '4427', '3663', 'e', 'n', '3565']


Output: 35658