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, 12, ['2725', '8267', 'Q', '4603', 'W', 'p', '8803', '2057', '5441', 'X', '773', 'v', '6685', '9739', '5203', '1233', 'n', 'N']