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: 16, 17, ['5985', '1925', 'r', 'H', 'p', 'L', '5019', 'y', 'O', '6575', '9729', 'S', '2497', '43', 'u', '317', 'p', '3043', '3247', 'z', 'O', '8379', '7715', '8399']
Example Output: 317

Example Input: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
Example Output: 0

Example Input: 6, 21, ['k', 'H', '693', '8515', 'v', '4427', 'v', 'q', '985', 'Q', 'Q', 'f', '2545', 'V', '3587', '4939', '3189', '1389', 'F', '9403', 'c', 'k', 'F']
Example Output:
30464