#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <complex>
#include <stdint.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

//#define NU_DEBUG

using namespace std;

#define REP(i,n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALLOF(c) (c).begin(), (c).end()

typedef double decimal;
const decimal EPS = 1e-8;

pair<int, int> find_origin(int x){
  int gid = 1;
  int mx = 10;
  while(x/gid >= mx){
    x += mx;
    gid++;
    mx *= 10;
  }
  return make_pair(x/gid, x%gid);
}

int main(){
  int start, digits;
  char buf[16];
  while(cin >> start >> digits){
    if(start == 0 && digits == 0) break;
    pair<int, int> org = find_origin(start);
    int n = org.first;
    int pos = org.second;
    while(digits > 0){
      int len = sprintf(buf, "%d", n);
      char *out = buf + pos;
      len -= pos;
      if(digits < len){
        out[digits] = '\0';
        len = digits;
      }
      cout << out;
      digits -= len;
      n++;
      pos = 0;
    }
    cout << endl;
  }

  return 0;
}