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.
8, 20, ['r', '4791', 'y', 'u', 'A', '709', 'I', '4937', 'l', 'b', '5583', 'u', 'j', 's', 'a', '7021', 'Y', '5055', '4965', '6419', '3933']