题号：NC222763
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld
题目描述
For a permutation 
of 
, let %7D)
be the number of 
satisfying 
and 
.
Given two integers and 
, your task is to find a permutation 
of such that is maximized.
Recall that in a permutation of, each integer from 
to (both inclusive) appears exactly once.
Given two integers
Recall that in a permutation of
输入描述:
There is only one test case in each test file.
The first and only line contains two integers).
输出描述:
Output one line containing
Please, DO NOT output extra spaces at the end of the line, or your answer may be considered incorrect!