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.
--------
Question: 2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']

Answer: 20324


Question: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']

Answer: 0


Question: 10, 11, ['4553', 's', '8275', '4231', 'P', 'V', '9045', '8611', 'q', 'L', '1045', '1719', '2011', 'j', '2049', 'y', 'B', '163', '4269', '6525', '4065', '2607', '8463', '2149', '2599']

Answer:
1045