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.
13, 20, ['y', 'e', '2331', '8479', '4727', '9877', 'j', '7863', 'f', '7295', 't', '3845', '4591', 'g', '4681', '7535', '2533', '9283', '8217', '6491']