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.
12, 15, ['7933', '6321', '6815', 'r', 'y', '2015', 'I', 'e', '7733', '1969', '1973', '3141', '6607', 'n', '5417', '5927', '8123', 'j', 'G', 'f', 'F', '3305', 'M', 'E', 'v', 'c']