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.
3, 10, ['q', 'Y', '5905', 'r', '6861', 'z', 'r', 'P', 'L', '4281', '7977', '6769', 'B', 'A', '2669', '4645', '731', 'J', '9561', '9821', '477', 'g', '3783', '3197', '7605', '3199', '8231', 'f', '3965']