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.
2, 3, ['q', '4221', '9583', 'o', 'I', 'c', 'B', 'd', 'O', '1497', '4821', '1331', 'X', '7131', '6409', 'A', '4119', 'j', '8959', 'j', 'K', 'V', '8575', 'n', 'W', '3995', 'Y']