Snuke Line

AtCoder

IDarc068_c

Time2000ms

Memory256MB

Difficulty—

Snuke has decided to play a game, where the player runs a railway company. There are $M+1$ stations on Snuke Line, numbered $0$ through $M$. A train on Snuke Line stops at station $0$ and every $d$\-th station thereafter, where $d$ is a predetermined constant for each train. For example, if $d = 3$, the train stops at station $0$, $3$, $6$, $9$, and so forth. There are $N$ kinds of souvenirs sold in areas around Snuke Line. The $i$\-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations $l_i$, $l_i+1$, $l_i+2$, $...$, $r_i$. There are $M$ values of $d$, the interval between two stops, for trains on Snuke Line: $1$, $2$, $3$, $...$, $M$. For each of these $M$ values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of $d$ at station $0$. Here, assume that it is not allowed to change trains. ## Constraints * $1 ≦ N ≦ 3 × 10^{5}$ * $1 ≦ M ≦ 10^{5}$ * $1 ≦ l_i ≦ r_i ≦ M$ ## Input The input is given from Standard Input in the following format: $N$ $M$ $l_1$ $r_1$ $:$ $l_{N}$ $r_{N}$ [samples]

Samples

Input #1

Output #1

3
2
2

*   If one takes a train stopping every station, three kinds of souvenirs can be purchased: kind $1$, $2$ and $3$.
*   If one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind $1$ and $2$.
*   If one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind $2$ and $3$.

Input #2

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Snuke Line",
    "description": {
      "content": "Snuke has decided to play a game, where the player runs a railway company. There are $M+1$ stations on Snuke Line, numbered $0$ through $M$. A train on Snuke Line stops at station $0$ and every $d$\\-t",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc068_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke has decided to play a game, where the player runs a railway company. There are $M+1$ stations on Snuke Line, numbered $0$ through $M$. A train on Snuke Line stops at station $0$ and every $d$\\-t...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments