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.

Ex Input:
3, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']

Ex Output:
55494


Ex Input:
6, 12, ['q', '8055', '5233', '5529', 'T', 'h', 'w', 'w', '9449', 'W', '7903', 'b', '6925']

Ex Output:
17352


Ex Input:
4, 6, ['5505', 'l', '2527', '5531', 'r', '6731', 'Y', '7881', 'Z', '3561', '9211', '8067', '125', 'e', 'B', '5781', 'h', '3173', '2947']

Ex Output:

12262