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.

Input: Consider Input: 2, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']

Output: 34470

Input: Consider Input: 2, 19, ['5671', '7557', '3823', '2307', '2763', 'b', 'E', '5081', '4431', '6143', '6939', '9417', '8697', '4175', 'n', '7633', '8723', 'A', '7583', '2081', '7577', '4019', 'q']

Output: 85272

Input: Consider Input: 2, 16, ['3197', '1479', 'k', '7739', 'D', 'l', '7919', 'O', '365', '5213', '1563', 'J', '6403', 'X', '1015', 'A', '3923', 'N', '4451', '8521']
Output: 31696