CF922F.Divisibility

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Imp is really pleased that you helped him. But it you solve the last problem, his gladness would raise even more.

Let's define for some set of integers as the number of pairs $a$ , $b$ in , such that:- $a$ is strictly less than $b$ ;

$a$ divides $b$ without a remainder.

You are to find such a set , which is a subset of ${1,2,...,n}$ (the set that contains all positive integers not greater than $n$ ), that .

输入格式

The only line contains two integers $n$ and $k$ .

输出格式

If there is no answer, print "No".

Otherwise, in the first line print "Yes", in the second — an integer $m$ that denotes the size of the set you have found, in the second line print $m$ integers — the elements of the set , in any order.

If there are multiple answers, print any of them.

输入输出样例

输入#1
```
3 3
```
输出#1
```
No
```
输入#2
```
6 6
```
输出#2
```
Yes
5
1 2 4 5 6 
```
输入#3
```
8 3
```
输出#3
```
Yes
4
2 4 5 8
```

说明/提示

In the second sample, the valid pairs in the output set are $(1,2)$ , $(1,4)$ , $(1,5)$ , $(1,6)$ , $(2,4)$ , $(2,6)$ . Thus, .

In the third example, the valid pairs in the output set are $(2,4)$ , $(4,8)$ , $(2,8)$ . Thus, .

首页