#include <bits/stdc++.h>
using namespace std;
const int N = 100;
long long f[N];
int a[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  k--;
  f[0] = 1;
  f[1] = 1;
  for (int i = 0; i < n; i++) a[i] = i + 1;
  for (int x = 2; x < N; x++) f[x] = f[x - 1] + f[x - 2];
  for (int i = 0; i < n - 1; i++) {
    if (k < f[n - i - 1]) continue;
    k -= f[n - i - 1];
    swap(a[i], a[i + 1]);
  }
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
  return 0;
}
