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, 14, ['d', 't', '5479', '4791', '8923', 'e', '6753', 'c', 'C', '7331', '4231', '1141', '6383', 'W', 'k', 'W', 'T', '5415', 'e', 'l', 'S']