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, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']

Output: 32351


Input: Consider Input: 8, 30, ['5585', '6253', '4067', '2991', '1809', 'y', '8803', 'e', 'T', '695', 'b', '8257', '6427', 'm', '2647', '2207', '3241', '3379', 'L', 'B', 'X', 'R', 'v', 'P', '3989', 'n', 'U', '6143', 'N', 'Y']

Output: 36985


Input: Consider Input: 4, 8, ['799', '3573', '9317', '1819', 'D', '4041', 'B', '8635', 'D', 'a', 'q', 'Q', 'F', 'd', '1359', 'J', 'K', '5235', 'p', 'p', 'S', '1999', '8401', 'X', '6197', '2235', 'B', 'a', '5845']


Output: 14495