#include <bits/stdc++.h>
using namespace std;
long long int fib[112] = {1, 1}, k;
int p[112], n;
int main() {
  for (int i = 2; i <= 85; i++) fib[i] = fib[i - 1] + fib[i - 2];
  cin >> n >> k;
  for (int i = 0; i < n; i++) p[i] = i;
  while (k > 0) {
    int pos = 0;
    while (fib[++pos] < k)
      ;
    pos--;
    k -= fib[pos];
    if (pos) swap(p[n - pos - 1], p[n - pos]);
  }
  for (int i = 0; i < n; i++) cout << p[i] + 1 << " ";
  cout << endl;
  return 0;
}
