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, 14, ['Y', '6349', '8287', '2969', '5719', '6209', 'q', 'T', '7249', 'w', 'e', '5559', '7775', '5617', 'L', 'T', '1861', '1583', '6885', 'C', '2601', '8483', 'w', 'r', '6301', 'c']