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, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']

Output: 28268


Input: Consider Input: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']

Output: 8825


Input: Consider Input: 6, 18, ['8035', 'q', 'o', 'o', 'i', 't', '7795', '8631', '5391', 'o', '1149', 'B', '325', '7739', '565', '35', '3297', '9727', 'P', '1773', '309', '6261', '2881', 'c', '1263']


Output: 44654