#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
unsigned long long dp[maxn];
unsigned long long n, k;
void dfs(int s, int l, unsigned long long p) {
  if (l == 0) return;
  if (l == 1) {
    if (s > 1) cout << ' ';
    cout << s;
  } else {
    int i = 1;
    for (; i <= l; i++) {
      if (dp[l - i] >= p)
        break;
      else
        p -= dp[l - i];
    }
    for (int j = s + i - 1; j >= s; j--) {
      if (s != 1 || j != (s + i - 1)) cout << ' ';
      cout << j;
    }
    if (i < l) dfs(s + i, l - i, p);
  }
}
int main() {
  cin >> n >> k;
  dp[1] = dp[0] = 1;
  for (int i = 2; i < maxn; i++) {
    if (dp[i - 1] >= ((unsigned long long)2e18))
      dp[i] = ((unsigned long long)2e18);
    dp[i] = dp[i - 1] + dp[i - 2];
  }
  dfs(1, n, k);
  cout << endl;
  return 0;
}
