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, 21, ['r', '3871', 'B', 'w', '8681', '5377', 'e', '6285', '3819', 'b', '1159', '1795', 'm', 'U', 'e', '8763', 'B', 'v', '6831', 'h', '8401', '7561', 'A', '2065', '3049', '9577']