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.
7, 21, ['9947', '7835', 'A', '6993', '8381', '7827', 'w', '3141', '5557', 'r', 'g', 'M', 'I', 'H', '8265', '6553', '7089', '1391', '5025', '5801', 'M', 'h']