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.
16, 26, ['3171', '8837', '849', 'H', 'q', 'O', '3821', 'N', '2805', 'l', 'L', 'P', 'H', '1007', '6111', '3511', 'e', 'N', '3773', '7373', '991', '3735', 'A', 'P', '5047', '7357', '4789', '7739', 'R']