// #define USE_CPP11
// #define USE_PRINTF

#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <complex>
#include <memory>
#include <sstream>

#ifdef USE_CPP11
#include <unordered_map>
#include <unordered_set>
#include <functional>
#endif

#define PRINT(obj) cout << obj << endl
#define REP(i, n) for(int (i) = 0; (i) < (n); i++)
#define SPACE " "

typedef long long ll;

using namespace std;

namespace Scanner {
#ifdef USE_PRINTF
  int    nextInt()    { int    d; scanf("%d" , &d); return d; }
  float  nextFloat()  { float  f; scanf("%f" , &f); return f; }
  double nextDouble() { double f; scanf("%lf", &f); return f; }  
  string nextString() { string s; scanf("%s" , &s); return s; }
  ll     nextll()     { ll     l; scanf("%ll", &l); return l; }
#else
  int    nextInt()    { int    d; cin >> d; return d; }
  float  nextFloat()  { float  f; cin >> f; return f; }
  double nextDouble() { double f; cin >> f; return f; }  
  string nextString() { string s; cin >> s; return s; }
  ll     nextll()     { ll     l; cin >> l; return l; }
#endif

  string getLine() { 
    string input;
    getline(cin, input);
    return input;
  }
};

namespace myLibrary {
  vector<string> split(const string& str, char delim) {
    vector<string> ret;
    size_t current = 0, found;
    while ((found = str.find_first_of(delim, current)) != string::npos) {
      ret.push_back(string(str, current, found - current));
      current = found + 1;
    }
    ret.push_back(string(str, current, str.size() - current));
    return ret;
  }
  
#ifdef USE_CPP11
  ///
  /// higher-order functional
  /// This is something like map in haskell, python, etc.
  /// Sample usage:
  ///   vector<int> a = {1, 2, 3, 4, 5};
  ///   vector<int> b = myLibrary::_Map<int, int>(a, [](int n){
  ///     return n * n;
  ///   });
  /// Result:
  ///   b = 1, 4, 9, 16, 25
  ///
  template<typename T_IN, typename T_OUT, class Functor>
  vector<T_OUT> _Map(vector<T_IN> src, Functor func) {
    vector<T_OUT> ret;
    for (int i = 0; i < src.size(); i++) {
      ret.push_back(func(src[i]));
    }
    return ret;
  }
#endif

};

/// BEGIN //////////////////////////////////////////////////////////

enum Type {
  MAX, MIN
};

int calc(Type t, int a, int L) {
  vector<int> v;
  int ret = 0;
  
  while (a != 0) {
    v.push_back(a % 10);
    a /= 10;
  }
  
  while (v.size() < L) {
    v.push_back(0);
  }
  
  if (t == MIN) {
    sort(v.begin(), v.end());
    for (int i = 0; i < v.size(); i++) {
      ret *= 10;
      ret += v[i];
    }
  } else if (t == MAX) {
    sort(v.begin(), v.end());
    for (int i = v.size() - 1; i >= 0; i--) {
      ret *= 10;
      ret += v[i];
    }
  }
  return ret;
}

void solve(int a, int L) {
  map<int, int> m;
  m[a] = 1;
  
  for (int i = 2; ; i++) {
    a = calc(MAX, a, L) - calc(MIN, a, L);
    if (m[a] != 0) {
      cout << (m[a] - 1) << SPACE << a << SPACE << i - m[a] << endl;
      break;  
    }
    m[a] = i;
  }
}

int main() {
  while (true) {
    int a = Scanner::nextInt();
    int L = Scanner::nextInt();
    
    if (a + L == 0) break;
    
    solve(a, L);
  }
  
  return 0;
}

/// END   //////////////////////////////////////////////////////////

Measured memory_bytes: 1220