




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						str	,					__UpperCamelCase      :						str				)  ->							list:
    UpperCAmelCase_										=					len(_SCREAMING_SNAKE_CASE				)
    UpperCAmelCase_										=					[]
    for i in range(len(_SCREAMING_SNAKE_CASE				) - pat_len + 1				):
        UpperCAmelCase_										=					True
        for j in range(_SCREAMING_SNAKE_CASE				):
            if s[i + j] != pattern[j]:
                UpperCAmelCase_										=					False
                break
        if match_found:
            position.append(_SCREAMING_SNAKE_CASE				)
    return position


if __name__ == "__main__":
 assert naive_pattern_search('ABCDEFG', 'DE') == [3]
 print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))











def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						Dict=2_8123				)  ->							str:
    UpperCAmelCase_										=					[1] * (limit + 1)

    for i in range(2	,					int(limit**0.5				) + 1				):
        sum_divs[i * i] += i
        for k in range(i + 1	,					limit // i + 1				):
            sum_divs[k * i] += k + i

    UpperCAmelCase_										=					set()
    UpperCAmelCase_										=					0

    for n in range(1	,					limit + 1				):
        if sum_divs[n] > n:
            abundants.add(__UpperCamelCase				)

        if not any((n - a in abundants) for a in abundants				):
            res += n

    return res


if __name__ == "__main__":
 print(solution())





