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: 11, 14, ['H', '4643', 'k', '9583', 'K', '3497', 'Q', '8111', '1837', 'Z', '6885', 'L', '1759', '7777', '3137']
Example Output: 16421

Example Input: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']
Example Output: 39464

Example Input: 15, 25, ['1795', '2753', '4659', '6407', 'r', 'q', '3705', 'h', '3657', 'K', '2641', 'm', '3809', '4259', '5681', '2253', '2073', 'a', 'L', 'e', '8239', 'w', 'P', 'n', 'f', 'e', 'f']
Example Output:
18246