#include <iostream>
#include <queue>

struct Bill {
    Bill(const std::string &_name, int _value) : name(_name), value(_value) { }

import Data.Bits
import Data.Char
import Numeric

char ch = [ch]

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

/////////////////////////////////////////////////////////////////////
//
//  Sudoku Solver using Knuth's Dancing Links algorithm (DLX)
//
/////////////////////////////////////////////////////////////////////

import std.stdio;

T[] permute(T)(T[] v, bool delegate(T[]) fn) {
	T[] ret;
	ret.length = v.length;

import std.stdio;

T[] permute(T)(T[] v, bool delegate(T[]) fn) {
	T[] ret;
	ret.length = v.length;

/*!
 *  \file   pi.c
 *  \brief  Calculates the nth digit of pi
 */

/////////////////////////////////////////////////////////////////////
//
//  Sudoku Solver using Knuth's Dancing Links algorithm (DLX)
//
/////////////////////////////////////////////////////////////////////

void main() {
  /+ /+ This should be ok +/ +/
  /* /* This should fail */ */
}

import std.stdio;

int bruteForceSchemey(string pat, string str, int start = 0) {
	int loop(int strOff, int patOff) {
		if(strOff == str.length && patOff != pat.length) {

import std.stdio;

int bruteForce(string containing, string str, int start = 0) {
	int matchStart = -1;
	int matchLen = 0;