Coprime 2

AtCoder

IDabc215_d

Time2000ms

Memory256MB

Difficulty—

Given a sequence of $N$ positive integers $A=(A_1,A_2,\dots,A_N)$, find every integer $k$ between $1$ and $M$ (inclusive) that satisfies the following condition: * $\gcd(A_i,k)=1$ for every integer $i$ such that $1 \le i \le N$. ## Constraints * All values in input are integers. * $1 \le N,M \le 10^5$ * $1 \le A_i \le 10^5$ ## Input Input is given from Standard Input in the following format: $N$ $M$ $A_1$ $A_2$ $\dots$ $A_N$ [samples]

Samples

Input #1

3 12
6 1 5

Output #1

3
1
7
11

For example, $7$ has the properties $\gcd(6,7)=1,\gcd(1,7)=1,\gcd(5,7)=1$, so it is included in the set of integers satisfying the requirement.  
On the other hand, $9$ has the property $\gcd(6,9)=3$, so it is not included in that set.  
We have three integers between $1$ and $12$ that satisfy the condition: $1$, $7$, and $11$. Be sure to print them in ascending order.

API Response (JSON)

{
  "problem": {
    "name": "Coprime 2",
    "description": {
      "content": "Given a sequence of $N$ positive integers $A=(A_1,A_2,\\dots,A_N)$, find every integer $k$ between $1$ and $M$ (inclusive) that satisfies the following condition: *   $\\gcd(A_i,k)=1$ for every integer",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc215_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given a sequence of $N$ positive integers $A=(A_1,A_2,\\dots,A_N)$, find every integer $k$ between $1$ and $M$ (inclusive) that satisfies the following condition:\n\n*   $\\gcd(A_i,k)=1$ for every integer...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments