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, 17, ['8805', '6507', 'e', '669', '5087', 's', '9', '5635', '3005', '1761', '3129', '5159', 'H', '7311', '6865', '8143', '455', '6919', 'r', '7297', 'W', 'l', '6375', 'B', 'B']