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.
2, 9, ['g', '683', '6419', 'b', '7', 'L', 'f', '5905', '4641', '581', 'B', '4201', 'H', '2337', 'Z', 'V', 'H', '6803', 'e', 'Z', 'P', 'E', 'o', 'T', 'b', 'G']