Minimum Integer

题意翻译

题意简述 给出$q$组询问，每组询问给出$l,r,d$，求一个最小的正整数$x$满足$d | x\ $且$ x \not\in [l,r]$ 输入格式 第一行一个正整数$q(1 \leq q \leq 500)$ 接下来$q$行每行三个正整数$l,r,d(1 \leq l \leq r \leq 10^9 , 1 \leq d \leq 10^9)$表示一组询问 输出格式 对于每一组询问输出一行表示答案

题目描述

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

5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5

输出样例 #1

6
4
1
3
10