Instructions: 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: 2, 18, ['w', '8995', 'g', '8909', 'F', '2955', 'h', 'i', '4245', 'v', 's', '3281', '357', 'V', '3557', '4091', 'O', 'v', '2905', '5865', 'c', '9879']
Output:
36390