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.

Example Input: 3, 5, ['c', '9619', 'e', 'A', '5045', '2453', 'L', '553', '5493', '5657']
Example Output: 5045

Example Input: 3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']
Example Output: 38666

Example Input: 3, 19, ['E', 'd', '799', '7425', 'E', 'T', '3607', 'z', 'J', 'F', 'z', '5009', '4309', 'x', '2851', 'i', '3103', 'j', 'r', 'J', '2323', 'c', '6019', '3953']
Example Output:
27103