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, 20, ['V', '4893', 'C', '5093', 'L', 's', 'S', '1435', '7347', 'R', '1337', 'X', 'P', '7303', '2801', '6725', 'w', '9579', 'i', 'g', '6903', 'i', 'K', 'v', 'I', '5651', '2427', '4133', '4421', 'k']