def max_product_remainder(nums, modulo):
nums.sort(reverse=True)
max_product = (nums[0] * nums[1]) % modulo
return max_product
# الأعداد للسؤال الفرعي 0
numbers_0 = [5, 5, 4, 8, 1, 7]
result_0 = max_product_remainder(numbers_0, 998244353)
print("سؤال فرعي 0:", result_0)
# الأعداد للسؤال الفرعي 1
numbers_1 = [5, 7, 4, 1, 1, 1, 9, 1, 9, 6, 4, 9, 1, 8, 8, 8, 1]
result_1 = max_product_remainder(numbers_1, 998244353)
print("سؤال فرعي 1:", result_1)
# الأعداد للسؤال الفرعي 2
numbers_2 = [3, 1, 4, 8, 4, 2, 8, 6, 6, 1, 6, 5, 5, 3, 4, 6, 1, 3, 7, 1, 6, 1, 9, 1, 3, 3, 3, 6, 5, 1, 5, 1, 8, 1, 6, 6, 8, 4, 9, 7, 3, 8, 4, 8, 2, 3, 3, 1, 4, 7, 8, 4, 9, 1, 9, 2, 1, 3, 6, 2, 8, 2, 1, 5, 6, 6, 6, 5, 7, 7, 7, 7, 3, 1, 8, 7, 6, 2, 8, 9, 1, 2, 3, 8, 2, 2, 1, 7, 1, 4, 5, 5, 8, 7, 9, 1, 8, 9, 3, 6]
result_2 = max_product_remainder(numbers_2, 998244353)
print("سؤال فرعي 2:", result_2)