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: 7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']

Output: 6189


Input: Consider Input: 9, 16, ['v', '5691', '4973', 'J', 'w', '539', '6957', '9953', 'L', 'c', '5879', 'b', 'g', '6681', 'C', '753', '5835', '1023', 'w', '5713', '159', 'X', 'z', 'i', '8379', '9753', '195', 'X']

Output: 13313


Input: Consider Input: 11, 16, ['4897', '3585', '7531', 'B', '4295', 'n', 'M', '5381', 'L', '5887', '8015', 'e', '9913', 's', '2143', 'j', '5657', 'x', '1909', '7073', '9973', 'L', 'Q']


Output: 20071