Language: Java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

class SuffixArray {
	class Suffix implements Comparable<Suffix> {
		int index;
		int[] rank = new int[2];

		public int compareTo(Suffix o) {
			if (rank[0] != o.rank[0])
				return rank[0] - o.rank[0];
			return rank[1] - o.rank[1];
		}
	}

	String str;

	public SuffixArray(String str) {
		this.str = str;
	}

	public int[] buildSuffixArray() {

		int n = str.length();
		Suffix[] suffixes = new Suffix[n];
		int[] arr = new int[n];
		// create and store suffixes
		// Also stores rank of first two chars of suffix
		for (int i = 0; i < n; i++) {
			suffixes[i] = new Suffix();
			suffixes[i].index = i;
			suffixes[i].rank[0] = str.charAt(i) - 'a';
			suffixes[i].rank[1] = ((i + 1) < n) ? (str.charAt(i + 1) - 'a') : -1;
		}

		Arrays.sort(suffixes);

		int[] ind = new int[n]; // to map index in suffix[] to index in original
								// string
		for (int k = 4; k < 2 * n; k = k * 2) {
			// Assigning rank and index values to first suffix
			int rank = 0;
			int prev_rank = suffixes[0].rank[0];
			suffixes[0].rank[0] = rank;
			ind[suffixes[0].index] = 0;

			// Assigning rank to suffixes
			for (int i = 1; i < n; i++) {
				// If first rank and next ranks are same as that of previous
				// suffix in array, assign the same new rank to this suffix
				if (suffixes[i].rank[0] == prev_rank && suffixes[i].rank[1] == suffixes[i - 1].rank[1]) {
					prev_rank = suffixes[i].rank[0];
					suffixes[i].rank[0] = rank;
				} else // Otherwise increment rank and assign
				{
					prev_rank = suffixes[i].rank[0];
					suffixes[i].rank[0] = ++rank;
				}
				ind[suffixes[i].index] = i;
			}

			// Assign next rank to every suffix
			for (int i = 0; i < n; i++) {
				int nextindex = suffixes[i].index + k / 2;
				suffixes[i].rank[1] = (nextindex < n) ? suffixes[ind[nextindex]].rank[0] : -1;
			}

			// Sort the suffixes according to first k characters
			Arrays.sort(suffixes);
		}

		for (int i = 0; i < n; i++)
			arr[i] = suffixes[i].index;

		return arr;
	}

	public int[] kasai(int[] sa) {
		int n = str.length(), k = 0;
		int[] lcp = new int[n];
		int[] rank = new int[n];
		for (int i = 0; i < n; i++)
			rank[sa[i]] = i;
		for (int i = 0; i < n; i++) {
			if (rank[i] == n - 1) {
				k = 0;
				continue;
			}
			int j = sa[rank[i] + 1];
			while (i + k < n && j + k < n && str.charAt(i + k) == str.charAt(j + k)) {
				k++;
			}
			lcp[rank[i]] = k;
			k = (k == 0) ? 0 : k - 1;
		}
		return lcp;
		
	}

}

public class Q1 {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String s = br.readLine();
		SuffixArray obj = new SuffixArray(s);
		int SA[] = obj.buildSuffixArray();
		int k = Integer.parseInt(br.readLine());

		Helper.tr(SA);
		int[] arr = obj.kasai(SA);
		Helper.tr(arr);
		
		int preCommon = 0;
		for (int i=0; i<arr.length; i++) {
			k -= s.length()-SA[i]-preCommon;
			Helper.tr(i, k);
			if (k<=0) {
				System.out.println(s.substring(SA[i], s.length()+k));
				break;
			}
			preCommon = arr[i];
		}
	}
}

Compiler output:
Main.java:104: error: class Q1 is public, should be declared in a file named Q1.java
public class Q1 {
       ^
Main.java:113: error: cannot find symbol
		Helper.tr(SA);
		^
  symbol:   variable Helper
  location: class Q1
Main.java:115: error: cannot find symbol
		Helper.tr(arr);
		^
  symbol:   variable Helper
  location: class Q1
Main.java:120: error: cannot find symbol
			Helper.tr(i, k);
			^
  symbol:   variable Helper
  location: class Q1
4 errors