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.
7, 23, ['H', 'W', 'N', '2591', '5067', 'x', '5995', '45', 's', 'w', '8581', '3061', '515', '5759', 'z', 'f', '2937', 'N', '663', '2521', '901', '21', '6853']