A12311 | $Minimum Integer$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given $q$ queries in the following form: Given three integers $l_i$ , $r_i$ and $d_i$ , find minimum positive integer $x_i$ such that it is divisible by $d_i$ and it does not belong to the segment $[l_i, r_i]$ . Can you answer all the queries? Recall that a number $x$ belongs to segment $[l, r]$ if $l \le x \le r$ .

The first line contains one integer $q$ ( $1 \le q \le 500$ ) — the number of queries. Then $q$ lines follow, each containing a query given in the format $l_i$ $r_i$ $d_i$ ( $1 \le l_i \le r_i \le 10^9$ , $1 \le d_i \le 10^9$ ). $l_i$ , $r_i$ and $d_i$ are integers.

For each query print one integer: the answer to this query.

输入 #1

输出 #1

C++ 编辑器

输入

输出