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, 13, ['L', '2895', '2311', 't', '2383', 'K', 'd', '3611', '3597', 'l', '2347', 'l', '3173', 'b', '159', '3807', '8217', '765', '9453', 'L']