CF390C Inna and Candy Boxes

Inna loves sweets very much. She has $ n $ closed present boxes lines up in a row in front of her. Each of these boxes contains either a candy (Dima's work) or nothing (Sereja's work). Let's assume that the boxes are numbered from 1 to $ n $ , from left to right. As the boxes are closed, Inna doesn't know which boxes contain candies and which boxes contain nothing. Inna chose number $ k $ and asked $ w $ questions to Dima to find that out. Each question is characterised by two integers $ l_{i},r_{i} $ ( $ 1

The first line of the input contains three integers $ n $ , $ k $ and $ w $ $ (1

For each question, print a single number on a single line — the minimum number of operations Dima needs to make the answer to the question positive.

For the first question, you need to take a candy from the first box to make the answer positive. So the answer is 1. For the second question, you need to take a candy from the first box, take a candy from the fifth box and put a candy to the sixth box. The answer is 3. For the third question, you need to take a candy from the fifth box and put it to the sixth box. The answer is 2.