{"problem":{"name":"Match Matching","description":{"content":"Find the largest integer that can be formed with exactly $N$ matchsticks, under the following conditions: *   Every digit in the integer must be one of the digits $A_1, A_2, ..., A_M (1 \\leq A_i \\leq","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc118_d"},"statements":[{"statement_type":"Markdown","content":"Find the largest integer that can be formed with exactly $N$ matchsticks, under the following conditions:\n\n*   Every digit in the integer must be one of the digits $A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9)$.\n*   The number of matchsticks used to form digits $1, 2, 3, 4, 5, 6, 7, 8, 9$ should be $2, 5, 5, 4, 5, 6, 3, 7, 6$, respectively.\n\n## Constraints\n\n*   All values in input are integers.\n*   $2 \\leq N \\leq 10^4$\n*   $1 \\leq M \\leq 9$\n*   $1 \\leq A_i \\leq 9$\n*   $A_i$ are all different.\n*   There exists an integer that can be formed by exactly $N$ matchsticks under the conditions.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $...$ $A_M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc118_d","tags":[],"sample_group":[["20 4\n3 7 8 4","777773\n\nThe integer $777773$ can be formed with $3 + 3 + 3 + 3 + 3 + 5 = 20$ matchsticks, and this is the largest integer that can be formed by $20$ matchsticks under the conditions."],["101 9\n9 8 7 6 5 4 3 2 1","71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a $64$\\-bit integer type."],["15 3\n5 4 6","654"]],"created_at":"2026-03-03 11:01:14"}}