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: 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: 12, 23, ['A', 'i', '4191', 'B', '2297', '3959', '1125', 'c', '739', '7887', 'p', '8173', '5301', '1969', '9737', '7011', '9845', 'r', '2977', 'z', 'Q', 'N', '3847', 's', 'D', '3391', 'T']

Output: 48860


Input: Consider Input: 17, 21, ['6511', 'L', 'i', '8913', '4735', '3645', 't', 'k', '3533', 'P', '7705', 'x', '1333', '6153', '3871', '1011', 'g', '6149', '8605', '9975', '2665', 'P', '1585', 'a', 'U', '5323', '9865']


Output: 27394