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: 1, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']

Output: 10387


Input: Consider Input: 7, 12, ['8785', '221', 'f', 'f', '5743', '4839', '9389', '4759', '1493', 'a', '4951', 'K', '8501', '3331', '2069', '2713', 'j', '7557', 'p', '7679', 'S', '6499', 'E', '439', 't', 'P', 'i', 'u', '8401', 'o']

Output: 20592


Input: Consider Input: 2, 15, ['D', '4525', 'a', 's', 'S', 'e', 'z', 'i', '2889', 'O', 'F', '4295', 'd', '8385', '8681', 'D', '5383', '843', 'w', 'e', 'm', 'K', 'r', '6049']


Output: 28775