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, ['D', '3939', '3811', '7687', 's', 'j', '2127', 'P', 'H', '7207', '7039', '6351', 'g', 'T', 'R', '4045', '2551', '1139', 'W', '3417', '4659', 'K', '4525', '7121', 'n', '9527', 'X']