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, 17, ['W', '5009', 'v', '9463', '8975', '6719', '3497', '5547', '2717', 'M', '1447', '7625', 'v', 'y', 'V', '3657', '1743', 'S', 'k', '5195', 'P']