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.

6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
13298

3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']
4295

3, 9, ['t', 'u', '8803', 'k', '7355', '3501', '8351', '653', '2309', '5455', 'f', 'K', '6465', '6249']

30972