#include <bits/stdc++.h>
using namespace std;
long long n, k, a[55];
int main() {
  a[0] = a[1] = 1;
  for (int i = 2; i <= 50; i++) a[i] = a[i - 1] + a[i - 2];
  cin >> n >> k;
  long long c1 = 1, c2 = 2;
  while (n > 0) {
    if (k > a[n - 1]) {
      cout << c2 << " " << c1 << " ";
      k -= a[n - 1], n -= 2, c2 += 2, c1 += 2;
    } else {
      cout << c1 << " ";
      n--, c1++, c2++;
    }
  }
  cout << endl;
  return 0;
}
