#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k;
  cin >> n >> k;
  long long int dp[52][2];
  dp[1][0] = 1;
  dp[1][1] = 0;
  for (int i = 1; i <= 50; i++) {
    dp[i + 1][1] = dp[i][0];
    dp[i + 1][0] = dp[i][1] + dp[i][0];
  }
  long long int sum[52];
  for (int i = 0; i <= 51; i++) {
    sum[i] = dp[i][1] + dp[i][0];
  }
  vector<int> pos;
  int temp = 0;
  while (temp < n - 1) {
    if (k > sum[n - temp - 1]) {
      k -= sum[n - temp - 1];
      pos.push_back(temp);
      temp += 2;
    } else {
      temp++;
    }
  }
  int a[52];
  for (int i = 0; i < n; i++) {
    a[i] = i + 1;
  }
  for (int i = 0; i < pos.size(); i++) {
    swap(a[pos[i]], a[pos[i] + 1]);
  }
  for (int i = 0; i < n - 1; i++) {
    cout << a[i] << " ";
  }
  cout << a[n - 1] << endl;
  return 0;
};
