Divisibility Sequence Generator

This problem requires you to generate a divisibility sequence of a specified length starting from a given number. Given two integers \( m \) and \( l \), you need to output a sequence where the first term is \( m \) and each subsequent term is obtained by multiplying the previous term by 2, i.e., \( a_{n+1} = 2 \times a_n \). For example, if \( m = 6 \) and \( l = 4 \), the sequence would be: 6, 12, 24, 48.

inputFormat

The input is provided via standard input and consists of two integers \( m \) and \( l \) separated by spaces or newlines. Here, \( m \) is the starting number and \( l \) is the length of the sequence.

outputFormat

Output the generated sequence as a single line of \( l \) integers separated by a single space.

6 4

6 12 24 48