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, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']

Output: 39464


Input: Consider Input: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']

Output: 6095


Input: Consider Input: 1, 12, ['a', 'A', 'Y', '8257', '1389', '815', '497', 's', '7411', '8509', 'D', '591']


Output: 27469