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.
2, 16, ['5985', '4035', 'z', '6625', 'W', '6605', 'X', 'p', 'E', '609', '9221', '1923', '4029', '8209', 'v', 'V', '3369', 'B', 's', '4937', 'c', 'Q', '2101']