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, 14, ['m', '5345', '1087', 'o', '3263', '209', 'P', 'h', '1219', '6231', 'L', 'M', '4105', 'B', '2917', 'y', '817', 'T', '4095', 'M', 'O', '1553', '867', 'z', '1329', '9975']