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, 11, ['7885', '719', '8165', '3469', 'Q', '2323', 'n', '905', '2477', '3579', '5181', '279', 'M', 'c', '3527', '4363', 'Z', '8873', 'D', '4021', 'H', '5169', '6935', 'L', 'e', '6993']