{"problem":{"name":"Mex of Subset Sum","description":{"content":"You are given an integer sequence of length $N$: $A=(A_1,A_2,\\dots,A_N)$. Find the $K$ smallest positive integers $X$ that satisfy the following condition. *   There is **no** non-empty (not necessar","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc062_c"},"statements":[{"statement_type":"Markdown","content":"You are given an integer sequence of length $N$: $A=(A_1,A_2,\\dots,A_N)$.\nFind the $K$ smallest positive integers $X$ that satisfy the following condition.\n\n*   There is **no** non-empty (not necessarily contiguous) subsequence of $A$ whose elements sum to $X$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 60$\n*   $1 \\leq K \\leq 1000$\n*   $1 \\leq A_i \\leq 10^{15}$\n*   All input values are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\dots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc062_c","tags":[],"sample_group":[["3 3\n1 2 5","4 9 10\n\nThe subsequences of $A$ are $(1),(2),(1,2),(5),(1,5),(2,5),(1,2,5)$, and their respective sums are $1,2,3,5,6,7,8$. Therefore, for $X=1,2,3,5,6,7,8$, there are subsequences of $A$ whose elements sum to $X$.\nOn the other hand, for $X=4,9,10$, there is no subsequence of $A$ whose elements sum to $X$."],["20 10\n324 60 1 15 60 15 1 60 319 1 327 1 2 60 2 345 1 2 2 15","14 29 44 59 74 89 104 119 134 149"]],"created_at":"2026-03-03 11:01:14"}}