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: 4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']

Output: 25920


Input: Consider Input: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']

Output: 59155


Input: Consider Input: 14, 19, ['8953', '9481', 'F', 'd', 'x', 'H', '4735', '9787', '3289', '815', 'm', 'c', 'M', 'Z', 'f', '633', 'P', 'C', 'F']


Output: 633