Problem: Gerald has a friend, Pollard. Pollard is interested in lucky tickets (ticket is a sequence of digits). At first he thought that a ticket is lucky if between some its digits we can add arithmetic signs and brackets so that the result obtained by the arithmetic expression was number 100. But he quickly analyzed all such tickets and moved on to a more general question. Now he explores k-lucky tickets.

Pollard sais that a ticket is k-lucky if we can add arithmetic operation signs between its digits to the left or right of them (i.e., "+", "-", " × ") and brackets so as to obtain the correct arithmetic expression whose value would equal k. For example, ticket "224201016" is 1000-lucky as ( - 2 - (2 + 4)) × (2 + 0) + 1016 = 1000.

Pollard was so carried away by the lucky tickets that he signed up for a seminar on lucky tickets and, as far as Gerald knows, Pollard will attend it daily at 7 pm in some famous institute and will commute to it in the same tram for m days. In this tram tickets have eight digits. And Gerald wants to make a surprise for Pollard: each day Pollard will receive a tram k-lucky ticket. The conductor has already agreed to give Pollard certain tickets during all these m days and he only wants Gerald to tell him what kind of tickets to give out. In this regard, help Gerald pick exactly m distinct k-lucky tickets.

Input

The single line contains two integers k and m (0 ≤ k ≤ 104, 1 ≤ m ≤ 3·105).

Output

Print m lines. Each line must contain exactly 8 digits — the k-winning ticket. The tickets may begin with 0, all tickets must be distinct. If there are more than m distinct k-lucky tickets, print any m of them. It is guaranteed that at least m distinct k-lucky tickets exist. The tickets can be printed in any order.

Examples

Input

0 3


Output

00000000
00000001
00000002


Input

7 4


Output

00000007
00000016
00000017
00000018

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1.5e5;
const long long BS = 1234567;
int n, m, rd;
int gt[5], ans[10], v[N + 10];
vector<int> d[N + 10], O;
map<long long, bool> ex;
struct node {
  int v[4];
};
vector<node> ds[N + 10];
vector<int> Deal(int l, int r) {
  if (l == r) {
    vector<int> res = O;
    res.push_back(gt[l]);
    return res;
  }
  vector<int> sc = O, res = O;
  for (int i = l; i < r; ++i) {
    vector<int> sa = Deal(l, i), sb = Deal(i + 1, r);
    for (int j = 0, end = (int)sa.size(); j < end; ++j) {
      for (int k = 0, end = (int)sb.size(); k < end; ++k) {
        sc.push_back(sa[j] + sb[k]), sc.push_back(sa[j] * sb[k]),
            sc.push_back(sa[j] - sb[k]);
      }
    }
  }
  int t = 0;
  for (int i = l; i <= r; ++i) t = t * 10 + gt[i];
  sc.push_back(t);
  sort(sc.begin(), sc.end());
  for (int i = 0, end = (int)sc.size(); i < end; ++i)
    if (!i || sc[i] != sc[i - 1]) res.push_back(sc[i]);
  return res;
}
void Dfs(int x) {
  if (x > 4) {
    vector<int> rlt = Deal(1, 4);
    node md;
    for (int i = 0; i < 4; ++i) md.v[i] = gt[i + 1];
    for (int i = 0, end = (int)rlt.size(); i < end; ++i)
      ds[rlt[i] + 1000].push_back(md);
    return;
  }
  for (int i = 0; i <= 9; ++i) {
    gt[x] = i;
    Dfs(x + 1);
    gt[x] = 0;
  }
}
void Insert() {
  long long h = 0;
  for (int i = 1; i <= 8; ++i) h = h * BS + (long long)ans[i];
  if (ex[h]) return;
  ex[h] = 1, --m;
  for (int i = 1; i <= 8; ++i) printf("%d", ans[i]);
  printf("\n");
  if (!m) exit(0);
}
void Out(int x, int y) {
  if (x < 0 || y < 0) return;
  for (int i = 0, end = (int)ds[x].size(); i < end; ++i) {
    for (int k = 1; k <= 4; ++k) ans[k] = ds[x][i].v[k - 1];
    for (int j = 0, end = (int)ds[y].size(); j < end; ++j) {
      for (int k = 5; k <= 8; ++k) ans[k] = ds[y][j].v[k - 5];
      Insert();
    }
  }
}
int main() {
  scanf("%d%d\n", &n, &m);
  Dfs(1);
  for (int i = 0, end = 9 * 9 * 9 * 9; i <= end; ++i) {
    Out(i + 1000, n - i + 1000);
    if (i && n % i == 0) Out(i + 1000, n / i + 1000);
    Out(i + 1000, i - n + 1000);
  }
  return 0;
}