#include <bits/stdc++.h>
using namespace std;
const int inf = 0x20202020;
const int mod = 1000000007;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 11111, M = 111111;
int l, m, n, t, C, vis[N];
void dfs(int num, int cal, int rest, int dep) {
  if (!m) return;
  if (dep > 3) {
    if (dep > 4) return;
    if (cal + n < 10000 && cal + n >= 0 && vis[cal + n] != num && m) {
      vis[cal + n] = num;
      printf("%04d%04d\n", cal + n, num);
      m--;
    }
    if (n - cal < 10000 && n - cal >= 0 && vis[n - cal] != num && m) {
      vis[n - cal] = num;
      printf("%04d%04d\n", n - cal, num);
      m--;
    }
    return;
  }
  dfs(num, cal + rest % 10, rest / 10, dep + 1);
  dfs(num, cal * (rest % 10), rest / 10, dep + 1);
  dfs(num, rest % 10 - cal, rest / 10, dep + 1);
  dfs(num, cal + rest % 100, rest / 100, dep + 2);
  dfs(num, cal * (rest % 100), rest / 100, dep + 2);
  dfs(num, rest % 100 - cal, rest / 100, dep + 2);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int _tmp = 9999, i = 0; i <= _tmp; ++i)
    dfs(i, i % 10, i / 10, 1), dfs(i, i % 100, i / 100, 2),
        dfs(i, i % 1000, i / 1000, 3);
  return 0;
}
