#include <bits/stdc++.h>
using namespace std;
const int Maxn = 60;
long long fib[Maxn], ans[Maxn];
long long n, k;
int main(int argc, const char* argv[]) {
  ios::sync_with_stdio(0);
  cin >> n >> k;
  int i;
  fib[1] = fib[2] = 1;
  for (i = 3; i <= 60; i++) fib[i] = fib[i - 1] + fib[i - 2];
  for (i = 1; i <= n; i++) ans[i] = i;
  i = n;
  while (1) {
    if (k == 1 && (i == 1 || i == 0)) break;
    if (k <= fib[i]) {
      i--;
      continue;
    }
    swap(ans[n - i + 1], ans[n - i + 2]);
    k -= fib[i];
    i -= 2;
  }
  for (i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
