{"problem":{"name":"Submask","description":{"content":"You are given a non-negative integer $N$. Print all non-negative integers $x$ that satisfy the following condition in ascending order. *   The set of the digit positions containing $1$ in the binary ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc269_c"},"statements":[{"statement_type":"Markdown","content":"You are given a non-negative integer $N$. Print all non-negative integers $x$ that satisfy the following condition in ascending order.\n\n*   The set of the digit positions containing $1$ in the binary representation of $x$ is a subset of the set of the digit positions containing $1$ in the binary representation of $N$.\n    *   That is, the following holds for every non-negative integer $k$: if the digit in the \"$2^k$s\" place of $x$ is $1$, the digit in the $2^k$s place of $N$ is $1$.\n\n## Constraints\n\n*   $N$ is an integer.\n*   $0 \\le N < 2^{60}$\n*   In the binary representation of $N$, at most $15$ digit positions contain $1$.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc269_c","tags":[],"sample_group":[["11","0\n1\n2\n3\n8\n9\n10\n11\n\nThe binary representation of $N = 11_{(10)}$ is $1011_{(2)}$.  \nThe non-negative integers $x$ that satisfy the condition are:\n\n*   $0000_{(2)}=0_{(10)}$\n*   $0001_{(2)}=1_{(10)}$\n*   $0010_{(2)}=2_{(10)}$\n*   $0011_{(2)}=3_{(10)}$\n*   $1000_{(2)}=8_{(10)}$\n*   $1001_{(2)}=9_{(10)}$\n*   $1010_{(2)}=10_{(10)}$\n*   $1011_{(2)}=11_{(10)}$"],["0","0"],["576461302059761664","0\n524288\n549755813888\n549756338176\n576460752303423488\n576460752303947776\n576461302059237376\n576461302059761664\n\nThe input may not fit into a $32$\\-bit signed integer."]],"created_at":"2026-03-03 11:01:14"}}