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.
6, 15, ['4393', '9115', 'k', '5849', '9017', 'W', '7053', 'V', '4875', 'c', '8707', 'I', 'W', 'W', '6303', '1205', '3827', '4843', 'J', '6241', '3469']