跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1974. Divisors

  • ID: 1980
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:提高
  • 上传者:
  • 枚举
  • 搜索
  • 模拟
  • 数论
  • 算法思想
  • 编程与模拟
  • 数学
  • 提高
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Divisors

题目描述

E. Divisors
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Bizon the Champion isn't just friendly, he also is a rigorous coder.

Let's define function f(a), where a is a sequence of integers. Function f(a) returns the following sequence: first all divisors of a1 go in the increasing order, then all divisors of a2 go in the increasing order, and so on till the last element of sequence a. For example, f([2,9,1])=[1,2,1,3,9,1].

Let's determine the sequence Xi, for integer i (i≥0): X0=[X] ([X] is a sequence consisting of a single number X), Xi=f(Xi-1) (i>0). For example, at X=6 we get X0=[6], X1=[1,2,3,6], X2=[1,1,2,1,3,1,2,3,6].

Given the numbers X and k, find the sequence Xk. As the answer can be rather large, find only the first 105 elements of this sequence.

Input

A single line contains two space-separated integers − X (1≤X≤1012) and k (0≤k≤1018).

Output

Print the elements of the sequence Xk in a single line, separated by a space. If the number of elements exceeds 105, then print only the first 105 elements.

Examples
Input
6 1
Output
1 2 3 6 
Input
4 2
Output
1 1 2 1 2 4 
Input
10 3
Output
1 1 1 2 1 1 5 1 1 2 1 5 1 2 5 10 

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1557 题。保留原作者与原赛事署名。