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, 17, ['4057', '6507', 'r', '4193', 'C', 'H', '5721', 's', '1153', 'F', 'x', 'O', '7475', 'f', '3477', 'a', 'Y', '3543', '1561', '8097', '7665', 'f', '2497', 'o', '9179', 'T', 'g']