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.
5, 11, ['F', 'J', '4409', '407', '3967', '2641', '3163', 'T', 't', 'y', '3173', '8677', 'q', 'T', 'X', 'M', '8377', '9425', 'Y', '5441', 'y', 'r', '199', 'T', '1773', 'S', '6717']