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.
11, 13, ['X', '8807', 'r', '371', '4171', 'F', 'm', '3687', '3995', '5541', 'Y', 'I', 'G', '4655', 'F', 'V', 's', '385', '633', 'V', 'g', 'i', '6311', 'B', '7497', '9137', 'd']