Last Card

AtCoder

IDabc227_a

Time2000ms

Memory256MB

Difficulty—

We will hand out a total of $K$ cards to $N$ people numbered $1, 2, \ldots, N$. Beginning with Person $A$, we will give the cards one by one to the people in this order: $A, A+1, A+2, \ldots, N, 1, 2, \ldots$. Who will get the last card? Formally, after Person $x(1 \leq x < N)$ gets a card, Person $x+1$ will get a card. After Person $N$ gets a card, Person $1$ gets a card. ## Constraints * $1 \leq N,K \leq 1000$ * $1 \leq A \leq N$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $K$ $A$ [samples]

Samples

Input #1

3 3 2

Output #1

1

The cards are given to Person $2, 3, 1$ in this order.

Input #2

1 100 1

Output #2

Input #3

3 14 2

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Last Card",
    "description": {
      "content": "We will hand out a total of $K$ cards to $N$ people numbered $1, 2, \\ldots, N$. Beginning with Person $A$, we will give the cards one by one to the people in this order: $A, A+1, A+2, \\ldots, N, 1, 2,",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc227_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We will hand out a total of $K$ cards to $N$ people numbered $1, 2, \\ldots, N$.\nBeginning with Person $A$, we will give the cards one by one to the people in this order: $A, A+1, A+2, \\ldots, N, 1, 2,...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments