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, 17, ['2473', '9699', '5331', 'S', 'p', 'r', '6481', '403', 'F', '2951', '9779', '6221', 'K', '9361', 't', 'f', '9923', 'V', '5011', 'x', 'O', '1771', 'u', '4377', '1529', 'P', 'k']