file
stringlengths 18
26
| data
stringlengths 3
1.04M
|
|---|---|
the_stack_data/231394235.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_iterative_power.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: ekutlay <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/11/08 20:44:48 by ekutlay #+# #+# */
/* Updated: 2021/11/08 20:53:23 by ekutlay ### ########.fr */
/* */
/* ************************************************************************** */
int ft_iterative_power(int nb, int power)
{
int i;
int n;
i = 1;
n = nb;
if (power < 0)
return (0);
if (power == 0)
return (1);
while (++i <= power)
{
nb *= n;
}
return (nb);
}
/*
#include <stdio.h>
int ft_iterative_power(int nb, int power);
int main(void)
{
int nb;
int power;
nb = 2;
power = 3;
printf("%d\n", ft_iterative_power(nb, power));
}
*/
|
the_stack_data/73575643.c |
#include <stdio.h>
#include <stdlib.h>
#include <signal.h> // sigaction(), sigsuspend(), sig*()
#include <unistd.h> // alarm()
void handle_signal(int signal);
void handle_sigalrm(int signal);
void do_sleep(int seconds);
/* Usage example
*
* First, compile and run this program:
* $ gcc signal.c
* $ ./a.out
*
* It will print out its pid. Use it from another terminal to send signals
* $ kill -HUP <pid>
* $ kill -USR1 <pid>
* $ kill -ALRM <pid>
*
* Exit the process with ^C ( = SIGINT) or SIGKILL, SIGTERM
*/
int main() {
struct sigaction sa;
// Print pid, so that we can send signals from other shells
printf("My pid is: %d\n", getpid());
// Setup the sighub handler
sa.sa_handler = &handle_signal;
// Restart the system call, if at all possible
sa.sa_flags = SA_RESTART;
// Block every signal during the handler
sigfillset(&sa.sa_mask);
// Intercept SIGHUP and SIGINT
if (sigaction(SIGHUP, &sa, NULL) == -1) {
perror("Error: cannot handle SIGHUP"); // Should not happen
}
if (sigaction(SIGUSR1, &sa, NULL) == -1) {
perror("Error: cannot handle SIGUSR1"); // Should not happen
}
// Will always fail, SIGKILL is intended to force kill your process
if (sigaction(SIGKILL, &sa, NULL) == -1) {
perror("Cannot handle SIGKILL"); // Will always happen
printf("You can never handle SIGKILL anyway...\n");
}
if (sigaction(SIGINT, &sa, NULL) == -1) {
perror("Error: cannot handle SIGINT"); // Should not happen
}
for (;;) {
printf("\nSleeping for ~3 seconds\n");
do_sleep(3); // Later to be replaced with a SIGALRM
}
}
void handle_signal(int signal) {
const char *signal_name;
sigset_t pending;
// Find out which signal we're handling
switch (signal) {
case SIGHUP:
signal_name = "SIGHUP";
break;
case SIGUSR1:
signal_name = "SIGUSR1";
break;
case SIGINT:
printf("Caught SIGINT, exiting now\n");
exit(0);
default:
fprintf(stderr, "Caught wrong signal: %d\n", signal);
return;
}
/*
* Please note that printf et al. are NOT safe to use in signal handlers.
* Look for async safe functions.
*/
printf("Caught %s, sleeping for ~3 seconds\n"
"Try sending another SIGHUP / SIGINT / SIGALRM "
"(or more) meanwhile\n", signal_name);
/*
* Indeed, all signals are blocked during this handler
* But, at least on OSX, if you send 2 other SIGHUP,
* only one will be delivered: signals are not queued
* However, if you send HUP, INT, HUP,
* you'll see that both INT and HUP are queued
* Even more, on my system, HUP has priority over INT
*
* There are two types of signals: standard signals,
* and realtime signals. Realtime signals are SIGRTMIN (34)
* and above.
* While there can be only one traditional signal waiting at
* a time for each type (i.e. one HUP, one INT etc), there
* However, there can be multiple realtime signals queued
* for each type (e.g. 3 SIGRTMIN, 4 SIGRTMAX...)
*
* See the other file for a list of all the signals available.
*/
do_sleep(3);
printf("Done sleeping for %s\n", signal_name);
// So what did you send me while I was asleep?
sigpending(&pending);
if (sigismember(&pending, SIGHUP)) {
printf("A SIGHUP is waiting\n");
}
if (sigismember(&pending, SIGUSR1)) {
printf("A SIGUSR1 is waiting\n");
}
printf("Done handling %s\n\n", signal_name);
}
void handle_sigalrm(int signal) {
if (signal != SIGALRM) {
fprintf(stderr, "Caught wrong signal: %d\n", signal);
}
printf("Got sigalrm, do_sleep() will end\n");
}
void do_sleep(int seconds) {
struct sigaction sa;
sigset_t mask;
sa.sa_handler = &handle_sigalrm; // Intercept and ignore SIGALRM
sa.sa_flags = SA_RESETHAND; // Remove the handler after first signal
sigfillset(&sa.sa_mask);
sigaction(SIGALRM, &sa, NULL);
// Get the current signal mask
sigprocmask(0, NULL, &mask);
// Unblock SIGALRM
sigdelset(&mask, SIGALRM);
// Wait with this mask
alarm(seconds);
sigsuspend(&mask);
printf("sigsuspend() returned\n");
}
|
the_stack_data/107953961.c |
#include <stdio.h>
int main(int argc, char *argv[], char *envp[])
{
int p;
for(p = 0; envp[p] && *envp[p]; p++) {
printf("%s\n", envp[p]);
}
return 0;
}
|
the_stack_data/162642763.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_strupcase.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: dshukla <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/01/17 09:46:43 by dshukla #+# #+# */
/* Updated: 2022/01/24 12:22:38 by dshukla ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
char *ft_strupcase(char *str)
{
int i;
i = 0;
while (str[i])
{
if (str[i] >= 'a' && str[i] <= 'z')
str[i] = str[i] - 32;
i++;
}
return (str);
}
/*
#include <stdio.h>
int main(){
char str[] = "hi";
printf("%s\n", ft_strupcase(str));
return 0;
}*/
|
the_stack_data/103025.c | #include <stdlib.h>
#include <limits.h>
#include <stdio.h>
#include <string.h>
typedef struct LE{
int v;
struct LE* next;
} ListElement;
typedef struct List{
ListElement* head;
ListElement* tail;
} List;
List* makeList(void){
List* l = malloc(sizeof(List));
l->head = l->tail = NULL;
return l;
}
void insertList(int v, List* l){
ListElement* tmp = malloc(sizeof(ListElement));
tmp->v = v;
tmp->next = NULL;
if(l->tail){
l->tail->next = tmp;
l->tail = tmp;
return;
}
l->head = l->tail = tmp;
}
int popList(List* l){
if(l->head){
ListElement* tmp = l->head;
int v = tmp->v;
l->head = tmp->next;
if(!l->head)
l->tail=NULL;
free(tmp);
return v;
}
return INT_MIN;
}
typedef struct E{
int v;
int p;
} PriorityQueueElement;
typedef struct PQ{
PriorityQueueElement** e;
int size;
int maxSize;
} PriorityQueue;
PriorityQueue* makeQueue(void){
PriorityQueue* pq = malloc(sizeof(PriorityQueue));
pq->size=0;
pq->maxSize=128;
pq->e = calloc(pq->maxSize, sizeof(PriorityQueueElement*));
return pq;
}
int expandQueue(PriorityQueue* pq){
pq->maxSize *= 2;
void* tmp;
if((tmp = realloc(pq->e, pq->maxSize * sizeof(PriorityQueueElement*))) == NULL){
free(pq->e);
return 0;
}
pq->e = tmp;
return 1;
}
void swapQueue(PriorityQueueElement* a, PriorityQueueElement* b){
PriorityQueueElement tmp = *a;
*a = *b;
*b = tmp;
}
int parent(int i) {
return (i - 1) / 2;
}
int left(int i) {
return 2 * i + 1;
}
int right(int i) {
return 2 * i + 2;
}
void siftUp(int i, PriorityQueue* pq){
while(i > 0 && pq->e[parent(i)]->p > pq->e[i]->p){
swapQueue(pq->e[i], pq->e[parent(i)]);
i = parent(i);
}
}
int insertQueue(int v, int p, PriorityQueue* pq){
if(pq->size == pq->maxSize)
if(!expandQueue(pq))
return 0;
pq->e[pq->size] = malloc(sizeof(PriorityQueueElement));
pq->e[pq->size]->v = v;
pq->e[pq->size]->p = p;
int i = pq->size++;
siftUp(i, pq);
return 1;
}
int emptyQueue(PriorityQueue* pq){
return pq->size ? 0 : 1;
}
int topQueue(PriorityQueue* pq){
return pq->size ? pq->e[0]->v : INT_MIN;
}
void heapifyQueue(int i, PriorityQueue* pq){
int l = left(i);
int r = right(i);
int smallest;
if(l < pq->size && pq->e[l]->p < pq->e[i]->p)
smallest = l;
else
smallest = i;
if(r < pq->size && pq->e[r]->p < pq->e[smallest]->p)
smallest = r;
if(smallest != i) {
swapQueue(pq->e[i], pq->e[smallest]);
heapifyQueue(smallest, pq);
}
}
int popQueue(PriorityQueue* pq){
if(pq->size){
int result = pq->e[0]->v;
pq->e[0] = pq->e[--pq->size];
heapifyQueue(0, pq);
return result;
}
return INT_MIN;
}
void priorityQueue(int v, int p, PriorityQueue* pq) {
List* list= makeList();
for(int i = 0; i < pq->size; i++) {
if(pq->e[i]->v == v && pq->e[i]->p > p) {
pq->e[i]->p = p;
insertList(i,list);
}
}
int tmp;
while((tmp = popList(list)) != INT_MIN) {
siftUp(tmp, pq);
}
}
void printQueue(PriorityQueue* pq){
for(int i=0; i < pq->size; i++)
printf("(%d, %d) ",pq->e[i]->v,pq->e[i]->p);
printf("\n");
}
int main(void){
PriorityQueue* pq = makeQueue();
int n;
scanf("%d",&n);
for(int i = 0; i < n; i++){
char command[20];
scanf("%s",command);
printf("|%s|\n",command);
if(!strcmp(command,"insert")){
int v, p;
scanf("%d",&v);
scanf("%d",&p);
if(!insertQueue(v, p, pq)){
fprintf(stderr,"Blad w relokacji pamieci\n");
return 1;
}
}
else if(!strcmp(command,"empty")){
printf("%d\n",emptyQueue(pq));
}
else if(!strcmp(command,"top")){
int top;
if((top = topQueue(pq)) != INT_MIN)
printf("%d\n",top);
else
printf("\n");
}
else if(!strcmp(command,"pop")){
int pop;
if((pop = popQueue(pq)) != INT_MIN)
printf("%d\n",pop);
else
printf("\n");
}
else if(!strcmp(command,"priority")) {
int v, p;
scanf("%d",&v);
scanf("%d",&p);
priorityQueue(v, p, pq);
}
else if(!strcmp(command,"print")) {
printQueue(pq);
}
}
return 0;
} |
the_stack_data/92327489.c | /* ************************************************************************** */
/* */
/* :::::::: */
/* ft_memset.c :+: :+: */
/* +:+ */
/* By: dmonfrin <[email protected]> +#+ */
/* +#+ */
/* Created: 2021/12/15 14:57:04 by dmonfrin #+# #+# */
/* Updated: 2021/12/15 14:57:06 by dmonfrin ######## odam.nl */
/* */
/* ************************************************************************** */
#include <stddef.h>
void *ft_memset(void *b, int c, size_t len)
{
size_t i;
i = 0;
while (i < len)
{
((char *)b)[i] = (char)c;
i++;
}
return (b);
}
|
the_stack_data/124763.c | float process_data(float* data, int n) {
int i;
float sum;
for (i = 0; i < n; i++) {
sum += data[i];
}
return sum;
}
float* global_data;
void set_global_data(float* data) {
global_data = data;
}
float process_global_data(int n) {
return process_data(global_data, n);
}
|
the_stack_data/92326701.c | /* { dg-do run } */
/* { dg-options "-O3 -mavx" } */
/* { dg-require-effective-target avx_runtime } */
extern void abort (void);
double ad[1024];
float af[1024];
short as[1024];
int ai[1024];
long long all[1024];
unsigned short aus[1024];
unsigned int au[1024];
unsigned long long aull[1024];
#define F(var) \
__attribute__((noinline, noclone)) __typeof (var[0]) \
f##var (void) \
{ \
int i; \
__typeof (var[0]) r = 0; \
for (i = 0; i < 1024; i++) \
r = r > var[i] ? r : var[i]; \
return r; \
}
#define TESTS \
F (ad) F (af) F (as) F (ai) F (all) F (aus) F (au) F (aull)
TESTS
int
main ()
{
int i;
for (i = 0; i < 1024; i++)
{
#undef F
#define F(var) var[i] = i;
TESTS
}
for (i = 1023; i < 32 * 1024; i += 1024 + 271)
{
#undef F
#define F(var) var[i & 1023] = i; if (f##var () != i) abort ();
TESTS
}
return 0;
}
|
the_stack_data/232955305.c | #include<stdio.h>
int main()
{
float A,B,MEDIA;
scanf("%f %f",&A,&B);
MEDIA=(A*3.5+B*7.5)/(3.5+7.5);
printf("MEDIA = %.5f",MEDIA);
return 0;
}
|
the_stack_data/82918.c | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#define TIMEOUT 30
#define FILES_COUNT 2
#define NAME_SIZE 64
#define LOGO "\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x37\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x30\x3b\x32\x32\x33\x3b\x32\x32\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x34\x3b\x32\x34\x36\x3b\x32\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x37\x3b\x32\x35\x31\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x33\x3b\x32\x30\x35\x3b\x32\x31\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x35\x3b\x32\x33\x30\x3b\x32\x33\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x33\x3b\x32\x34\x30\x3b\x32\x34\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x36\x3b\x31\x39\x31\x3b\x31\x39\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x34\x3b\x32\x33\x35\x3b\x32\x33\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x33\x3b\x32\x34\x35\x3b\x32\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x39\x3b\x31\x35\x33\x3b\x31\x36\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x36\x3b\x32\x30\x39\x3b\x32\x31\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x34\x3b\x32\x33\x38\x3b\x32\x34\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x32\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x39\x3b\x32\x32\x38\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x3b\x32\x30\x32\x3b\x32\x30\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x36\x3b\x32\x30\x37\x3b\x32\x31\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x38\x3b\x32\x33\x37\x3b\x32\x34\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x33\x3b\x32\x31\x37\x3b\x32\x32\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x31\x3b\x32\x34\x37\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x33\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x32\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x38\x3b\x31\x36\x31\x3b\x31\x37\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x38\x3b\x32\x30\x32\x3b\x32\x30\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x37\x3b\x31\x36\x31\x3b\x31\x37\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x35\x3b\x32\x31\x38\x3b\x32\x32\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x32\x3b\x31\x37\x36\x3b\x31\x38\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x36\x3b\x32\x33\x37\x3b\x32\x34\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x39\x3b\x32\x32\x36\x3b\x32\x33\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x39\x3b\x32\x34\x36\x3b\x32\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x3b\x32\x30\x30\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x37\x3b\x32\x31\x36\x3b\x32\x32\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x32\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x38\x3b\x32\x30\x35\x3b\x32\x31\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x34\x3b\x32\x30\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x33\x3b\x32\x33\x31\x3b\x32\x33\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x36\x37\x3b\x31\x37\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x33\x3b\x32\x33\x33\x3b\x32\x33\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x34\x3b\x31\x37\x38\x3b\x31\x38\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x38\x3b\x31\x36\x34\x3b\x31\x37\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x37\x3b\x31\x35\x35\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x30\x3b\x31\x39\x38\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x34\x3b\x32\x35\x30\x3b\x32\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x39\x3b\x31\x35\x37\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x37\x3b\x32\x31\x35\x3b\x32\x32\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x35\x3b\x32\x34\x33\x3b\x32\x34\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x36\x3b\x32\x31\x31\x3b\x32\x31\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x36\x3b\x32\x33\x34\x3b\x32\x33\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x37\x3b\x32\x30\x36\x3b\x32\x31\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x32\x3b\x32\x32\x32\x3b\x32\x32\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x3b\x32\x30\x33\x3b\x32\x30\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x32\x3b\x32\x34\x39\x3b\x32\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x39\x3b\x32\x33\x31\x3b\x32\x33\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x32\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x36\x3b\x32\x31\x39\x3b\x32\x32\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x3b\x32\x30\x33\x3b\x32\x30\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x34\x3b\x32\x32\x31\x3b\x32\x32\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x32\x30\x32\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x35\x38\x3b\x31\x37\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x37\x39\x3b\x31\x38\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x35\x30\x3b\x31\x36\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x36\x3b\x31\x37\x30\x3b\x31\x38\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x39\x3b\x31\x35\x32\x3b\x31\x36\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x34\x3b\x32\x34\x31\x3b\x32\x34\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x34\x3b\x32\x30\x34\x3b\x32\x31\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x30\x3b\x32\x34\x34\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x30\x3b\x31\x38\x34\x3b\x31\x39\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x38\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x37\x3b\x31\x37\x30\x3b\x31\x38\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x38\x3b\x31\x37\x30\x3b\x31\x38\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x30\x3b\x32\x32\x39\x3b\x32\x33\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x31\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x33\x3b\x31\x38\x35\x3b\x31\x39\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x33\x3b\x32\x34\x35\x3b\x32\x34\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x34\x3b\x32\x35\x32\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x32\x3b\x32\x32\x39\x3b\x32\x33\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x37\x3b\x32\x35\x30\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x39\x3b\x32\x30\x34\x3b\x32\x31\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x30\x3b\x32\x32\x33\x3b\x32\x33\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x38\x3b\x32\x30\x38\x3b\x32\x31\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x38\x3b\x32\x33\x35\x3b\x32\x33\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x36\x3b\x32\x31\x31\x3b\x32\x31\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x38\x3b\x32\x34\x32\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x32\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x34\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x39\x3b\x32\x34\x33\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x3b\x31\x35\x31\x3b\x31\x36\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x37\x3b\x31\x38\x38\x3b\x31\x39\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x35\x33\x3b\x31\x36\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x37\x36\x3b\x31\x38\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x35\x37\x3b\x31\x36\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x38\x38\x3b\x31\x39\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x33\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x32\x30\x33\x3b\x32\x30\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x34\x3b\x32\x30\x36\x3b\x32\x31\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x33\x30\x3b\x32\x33\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x37\x3b\x32\x30\x39\x3b\x32\x31\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x37\x3b\x32\x33\x37\x3b\x32\x34\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x31\x3b\x32\x31\x32\x3b\x32\x31\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x30\x3b\x31\x35\x33\x3b\x31\x36\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x37\x3b\x32\x34\x36\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x35\x3b\x31\x39\x35\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x39\x3b\x31\x35\x33\x3b\x31\x36\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x30\x3b\x32\x31\x31\x3b\x32\x31\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x30\x3b\x31\x36\x37\x3b\x31\x37\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x36\x3b\x32\x31\x38\x3b\x32\x32\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x35\x3b\x32\x33\x36\x3b\x32\x34\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x33\x3b\x32\x30\x37\x3b\x32\x31\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x39\x3b\x32\x30\x35\x3b\x32\x31\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x39\x38\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x31\x3b\x32\x32\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x3b\x32\x30\x32\x3b\x32\x30\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x30\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x32\x3b\x32\x32\x39\x3b\x32\x33\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x36\x3b\x32\x32\x30\x3b\x32\x32\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x34\x3b\x31\x36\x33\x3b\x31\x37\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x38\x3b\x31\x35\x36\x3b\x31\x36\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x36\x3b\x31\x38\x37\x3b\x31\x39\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x3b\x31\x35\x30\x3b\x31\x36\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x31\x3b\x32\x34\x34\x3b\x32\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x37\x3b\x32\x30\x35\x3b\x32\x31\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x37\x3b\x32\x34\x35\x3b\x32\x34\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x35\x3b\x32\x32\x34\x3b\x32\x33\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x30\x3b\x32\x34\x32\x3b\x32\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x35\x3b\x32\x31\x31\x3b\x32\x31\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x31\x3b\x32\x31\x34\x3b\x32\x32\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x32\x3b\x31\x39\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x39\x3b\x32\x34\x36\x3b\x32\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x33\x3b\x32\x32\x37\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x32\x3b\x32\x33\x39\x3b\x32\x34\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x37\x3b\x31\x38\x32\x3b\x31\x39\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x34\x3b\x32\x32\x37\x3b\x32\x33\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x33\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x33\x3b\x31\x37\x31\x3b\x31\x38\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x35\x3b\x32\x33\x36\x3b\x32\x33\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x31\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x37\x3b\x32\x31\x31\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x32\x3b\x32\x31\x36\x3b\x32\x32\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x34\x3b\x32\x31\x31\x3b\x32\x31\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x34\x3b\x32\x34\x33\x3b\x32\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x37\x3b\x31\x36\x39\x3b\x31\x37\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x32\x3b\x31\x37\x37\x3b\x31\x38\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x36\x3b\x31\x36\x34\x3b\x31\x37\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x39\x3b\x32\x32\x35\x3b\x32\x32\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x38\x3b\x32\x33\x32\x3b\x32\x33\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x37\x3b\x32\x30\x33\x3b\x32\x31\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x32\x3b\x32\x34\x39\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x36\x3b\x32\x30\x34\x3b\x32\x31\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x31\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x30\x3b\x32\x32\x38\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x31\x3b\x32\x31\x32\x3b\x32\x31\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x37\x3b\x31\x35\x33\x3b\x31\x36\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x38\x3b\x32\x34\x33\x3b\x32\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x3b\x31\x35\x31\x3b\x31\x36\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x38\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x34\x3b\x32\x32\x33\x3b\x32\x32\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x37\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x31\x36\x38\x3b\x31\x37\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x36\x3b\x31\x39\x32\x3b\x31\x39\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x31\x3b\x31\x38\x39\x3b\x31\x39\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x38\x3b\x32\x30\x37\x3b\x32\x31\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x36\x3b\x32\x30\x36\x3b\x32\x31\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x30\x3b\x32\x32\x38\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x30\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x37\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x34\x3b\x31\x35\x39\x3b\x31\x37\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x31\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x39\x3b\x31\x37\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x39\x3b\x31\x37\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x32\x3b\x31\x38\x39\x3b\x31\x39\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x31\x3b\x31\x38\x39\x3b\x31\x39\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x37\x3b\x32\x35\x31\x3b\x32\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x37\x3b\x31\x39\x30\x3b\x31\x39\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x31\x3b\x32\x33\x39\x3b\x32\x34\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x33\x3b\x32\x31\x33\x3b\x32\x31\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x36\x3b\x32\x30\x36\x3b\x32\x31\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x35\x3b\x32\x32\x33\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x34\x3b\x31\x36\x32\x3b\x31\x37\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x36\x3b\x32\x34\x32\x3b\x32\x34\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x36\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x32\x3b\x32\x33\x31\x3b\x32\x33\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x33\x3b\x32\x34\x35\x3b\x32\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x35\x3b\x32\x30\x36\x3b\x32\x31\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x31\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x30\x3b\x32\x32\x38\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x39\x3b\x32\x33\x32\x3b\x32\x33\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x35\x3b\x32\x34\x32\x3b\x32\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x34\x3b\x32\x32\x39\x3b\x32\x33\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x33\x3b\x31\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x39\x3b\x32\x34\x33\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x35\x3b\x31\x38\x31\x3b\x31\x38\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x30\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x33\x3b\x32\x32\x37\x3b\x32\x33\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x36\x3b\x31\x34\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x36\x3b\x32\x34\x36\x3b\x32\x34\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x34\x3b\x31\x39\x33\x3b\x32\x30\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x31\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x36\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x30\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x39\x3b\x32\x31\x37\x3b\x32\x32\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x38\x3b\x32\x32\x35\x3b\x32\x32\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x33\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x32\x3b\x32\x31\x39\x3b\x32\x32\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x31\x3b\x32\x32\x33\x3b\x32\x32\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x34\x3b\x31\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x39\x3b\x32\x32\x31\x3b\x32\x32\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x36\x3b\x31\x35\x35\x3b\x31\x36\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x34\x3b\x32\x34\x31\x3b\x32\x34\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x32\x3b\x31\x38\x33\x3b\x31\x39\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x34\x3b\x32\x30\x38\x3b\x32\x31\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x32\x3b\x31\x33\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x30\x39\x3b\x32\x31\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x34\x3b\x31\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x39\x3b\x32\x30\x38\x3b\x32\x31\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x33\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x33\x3b\x32\x30\x39\x3b\x32\x31\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x31\x3b\x32\x31\x33\x3b\x32\x31\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x34\x3b\x31\x34\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x39\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x36\x3b\x32\x32\x39\x3b\x32\x33\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x34\x3b\x32\x32\x30\x3b\x32\x32\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x32\x3b\x32\x34\x35\x3b\x32\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x35\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x37\x3b\x31\x38\x39\x3b\x31\x39\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x33\x3b\x31\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x34\x3b\x31\x39\x31\x3b\x31\x39\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x32\x3b\x31\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x33\x3b\x32\x31\x37\x3b\x32\x32\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x33\x3b\x31\x36\x33\x3b\x31\x37\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x30\x3b\x32\x33\x39\x3b\x32\x34\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x31\x3b\x32\x32\x37\x3b\x32\x33\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x34\x3b\x31\x38\x34\x3b\x31\x39\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x32\x3b\x32\x30\x38\x3b\x32\x31\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x31\x3b\x31\x33\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x32\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x30\x3b\x31\x39\x36\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x31\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x32\x3b\x32\x33\x36\x3b\x32\x33\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x33\x3b\x31\x36\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x32\x3b\x32\x30\x37\x3b\x32\x31\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x30\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x39\x3b\x32\x33\x35\x3b\x32\x33\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x38\x3b\x31\x38\x38\x3b\x31\x39\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x30\x3b\x31\x39\x33\x3b\x31\x39\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x36\x3b\x32\x34\x36\x3b\x32\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x31\x3b\x31\x39\x32\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x38\x3b\x31\x34\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x3b\x31\x35\x31\x3b\x31\x36\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x3b\x31\x35\x32\x3b\x31\x36\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x37\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x36\x3b\x32\x30\x33\x3b\x32\x30\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x36\x3b\x32\x31\x35\x3b\x32\x32\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x31\x3b\x31\x38\x37\x3b\x31\x39\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x35\x3b\x32\x30\x36\x3b\x32\x31\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x3b\x31\x34\x39\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x3b\x31\x34\x39\x3b\x31\x36\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x35\x3b\x32\x34\x31\x3b\x32\x34\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x36\x3b\x32\x34\x32\x3b\x32\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x32\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x32\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x37\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x38\x3b\x32\x33\x39\x3b\x32\x34\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x33\x35\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x37\x3b\x31\x37\x37\x3b\x31\x38\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x30\x3b\x31\x37\x38\x3b\x31\x38\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x37\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x39\x3b\x32\x31\x37\x3b\x32\x32\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x32\x3b\x32\x31\x39\x3b\x32\x32\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x33\x30\x3b\x31\x34\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x35\x3b\x31\x38\x39\x3b\x31\x39\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x38\x3b\x31\x39\x30\x3b\x31\x39\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x33\x3b\x31\x36\x32\x3b\x31\x37\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x39\x3b\x31\x36\x30\x3b\x31\x37\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x37\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x36\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x35\x3b\x31\x35\x37\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x3b\x31\x35\x30\x3b\x31\x36\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x34\x3b\x32\x33\x32\x3b\x32\x33\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x33\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x34\x3b\x32\x31\x33\x3b\x32\x31\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x33\x3b\x32\x31\x34\x3b\x32\x31\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x31\x3b\x31\x37\x30\x3b\x31\x37\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x37\x3b\x31\x38\x36\x3b\x31\x39\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x39\x3b\x31\x39\x34\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x36\x3b\x32\x32\x38\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x32\x3b\x32\x31\x33\x3b\x32\x31\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x31\x3b\x32\x31\x37\x3b\x32\x32\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x39\x3b\x32\x33\x30\x3b\x32\x33\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x39\x3b\x31\x38\x32\x3b\x31\x39\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x34\x3b\x32\x30\x36\x3b\x32\x31\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x32\x3b\x31\x39\x36\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x35\x3b\x32\x33\x32\x3b\x32\x33\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x31\x3b\x32\x31\x37\x3b\x32\x32\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x30\x3b\x31\x37\x38\x3b\x31\x38\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x3b\x31\x35\x30\x3b\x31\x36\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x38\x3b\x31\x34\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x35\x3b\x31\x36\x32\x3b\x31\x37\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x31\x3b\x31\x38\x37\x3b\x31\x39\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x31\x3b\x32\x34\x30\x3b\x32\x34\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x37\x3b\x32\x34\x37\x3b\x32\x34\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x35\x3b\x32\x31\x32\x3b\x32\x31\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x37\x3b\x31\x36\x38\x3b\x31\x37\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x36\x3b\x31\x36\x33\x3b\x31\x37\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x32\x3b\x31\x39\x33\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x32\x3b\x32\x34\x39\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x39\x3b\x31\x39\x37\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x30\x3b\x31\x39\x37\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x36\x3b\x32\x32\x30\x3b\x32\x32\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x37\x3b\x32\x31\x32\x3b\x32\x31\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x37\x3b\x31\x34\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x32\x37\x3b\x31\x34\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x38\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x32\x3b\x32\x31\x33\x3b\x32\x31\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x37\x3b\x32\x35\x31\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x34\x3b\x31\x35\x39\x3b\x31\x37\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x38\x3b\x31\x37\x30\x3b\x31\x37\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x38\x3b\x32\x34\x33\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x39\x3b\x32\x34\x33\x3b\x32\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x32\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x32\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x38\x3b\x32\x33\x39\x3b\x32\x34\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x35\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x39\x3b\x31\x37\x38\x3b\x31\x38\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x38\x3b\x31\x36\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x31\x3b\x31\x35\x37\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x36\x3b\x32\x35\x31\x3b\x32\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x30\x3b\x31\x35\x37\x3b\x31\x36\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x31\x3b\x31\x35\x37\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x30\x3b\x32\x31\x37\x3b\x32\x32\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x37\x3b\x31\x39\x30\x3b\x31\x39\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x34\x3b\x31\x38\x38\x3b\x31\x39\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x32\x3b\x31\x36\x32\x3b\x31\x37\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x31\x3b\x31\x36\x36\x3b\x31\x37\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x30\x3b\x31\x39\x36\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x32\x3b\x31\x37\x35\x3b\x31\x38\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x37\x3b\x31\x36\x33\x3b\x31\x37\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x38\x3b\x31\x37\x37\x3b\x31\x38\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x39\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x33\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x33\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x36\x3b\x32\x34\x36\x3b\x32\x34\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x38\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x30\x3b\x31\x38\x32\x3b\x31\x39\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x31\x3b\x31\x38\x33\x3b\x31\x39\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x31\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x33\x3b\x32\x32\x33\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x34\x3b\x32\x35\x30\x3b\x32\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x34\x3b\x32\x35\x30\x3b\x32\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x3b\x31\x35\x35\x3b\x31\x36\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x3b\x31\x35\x32\x3b\x31\x36\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x3b\x31\x35\x30\x3b\x31\x36\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x3b\x31\x35\x35\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x35\x3b\x32\x34\x36\x3b\x32\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x31\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x38\x3b\x31\x37\x33\x3b\x31\x38\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x33\x3b\x31\x37\x30\x3b\x31\x38\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x38\x3b\x31\x34\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x30\x3b\x31\x36\x33\x3b\x31\x37\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x35\x3b\x31\x36\x32\x3b\x31\x37\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x38\x3b\x32\x34\x33\x3b\x32\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x37\x3b\x32\x34\x33\x3b\x32\x34\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x33\x3b\x32\x34\x39\x3b\x32\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x32\x3b\x31\x38\x39\x3b\x31\x39\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x3b\x31\x35\x32\x3b\x31\x36\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x34\x3b\x31\x38\x39\x3b\x31\x39\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x36\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x31\x36\x37\x3b\x31\x37\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x34\x3b\x31\x39\x31\x3b\x31\x39\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x38\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x36\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x31\x3b\x31\x38\x34\x3b\x31\x39\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x38\x3b\x32\x30\x37\x3b\x32\x31\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x36\x3b\x32\x34\x36\x3b\x32\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x38\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x38\x3b\x31\x37\x36\x3b\x31\x38\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x3b\x31\x34\x39\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x3b\x31\x35\x30\x3b\x31\x36\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x37\x3b\x32\x34\x32\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x36\x3b\x32\x34\x32\x3b\x32\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x32\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x32\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x31\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x34\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x38\x3b\x32\x33\x39\x3b\x32\x34\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x37\x3b\x31\x37\x37\x3b\x31\x38\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x38\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x31\x3b\x32\x34\x39\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x3b\x31\x34\x38\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x34\x3b\x32\x34\x35\x3b\x32\x34\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x38\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x31\x3b\x32\x34\x39\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x39\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x33\x3b\x32\x31\x34\x3b\x32\x31\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x33\x31\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x34\x3b\x31\x38\x38\x3b\x31\x39\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x39\x3b\x31\x39\x30\x3b\x31\x39\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x39\x3b\x31\x36\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x3b\x31\x35\x31\x3b\x31\x36\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x38\x3b\x32\x32\x31\x3b\x32\x32\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x37\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x36\x3b\x32\x35\x31\x3b\x32\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x32\x3b\x31\x35\x38\x3b\x31\x36\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x3b\x31\x34\x38\x3b\x31\x36\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x38\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x38\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x31\x3b\x31\x38\x33\x3b\x31\x39\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x33\x3b\x31\x38\x34\x3b\x31\x39\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x33\x33\x3b\x31\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x34\x3b\x32\x32\x33\x3b\x32\x32\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x35\x3b\x32\x32\x33\x3b\x32\x32\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x31\x3b\x31\x37\x30\x3b\x31\x38\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x31\x3b\x32\x31\x38\x3b\x32\x32\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x31\x3b\x31\x36\x31\x3b\x31\x37\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x34\x3b\x31\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x38\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x36\x3b\x31\x36\x36\x3b\x31\x37\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x32\x3b\x32\x34\x34\x3b\x32\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x30\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x33\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x37\x3b\x32\x30\x33\x3b\x32\x30\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x32\x3b\x32\x30\x35\x3b\x32\x31\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x34\x3b\x32\x32\x33\x3b\x32\x32\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x38\x3b\x31\x37\x37\x3b\x31\x38\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x33\x3b\x32\x33\x32\x3b\x32\x33\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x37\x3b\x31\x37\x33\x3b\x31\x38\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x34\x3b\x31\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x30\x3b\x31\x36\x31\x3b\x31\x37\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x37\x3b\x32\x32\x30\x3b\x32\x32\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x39\x3b\x31\x39\x39\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x33\x3b\x31\x34\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x33\x3b\x31\x37\x31\x3b\x31\x38\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x34\x3b\x31\x36\x32\x3b\x31\x37\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x37\x3b\x32\x35\x31\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x34\x3b\x31\x39\x38\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x38\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x31\x36\x37\x3b\x31\x37\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x38\x3b\x31\x38\x38\x3b\x31\x39\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x32\x3b\x31\x38\x39\x3b\x31\x39\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x37\x3b\x32\x32\x30\x3b\x32\x32\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x37\x3b\x32\x33\x30\x3b\x32\x33\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x32\x3b\x31\x34\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x39\x3b\x31\x37\x36\x3b\x31\x38\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x39\x3b\x31\x36\x31\x3b\x31\x37\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x35\x3b\x31\x37\x32\x3b\x31\x38\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x3b\x31\x34\x39\x3b\x31\x36\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x31\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x32\x3b\x31\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x34\x3b\x32\x30\x32\x3b\x32\x30\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x38\x3b\x31\x38\x36\x3b\x31\x39\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x38\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x34\x3b\x32\x34\x31\x3b\x32\x34\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x33\x3b\x32\x34\x39\x3b\x32\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x32\x3b\x32\x30\x39\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x38\x3b\x32\x30\x38\x3b\x32\x31\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x34\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x32\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x35\x3b\x32\x33\x31\x3b\x32\x33\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x37\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x35\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x30\x3b\x31\x34\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x38\x3b\x31\x36\x31\x3b\x31\x37\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x31\x3b\x31\x37\x35\x3b\x31\x38\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x32\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x39\x3b\x32\x31\x37\x3b\x32\x32\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x37\x3b\x32\x33\x33\x3b\x32\x33\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x34\x3b\x31\x33\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x36\x3b\x31\x35\x35\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x39\x3b\x31\x38\x36\x3b\x31\x39\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x36\x3b\x32\x31\x31\x3b\x32\x31\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x39\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x32\x3b\x31\x38\x37\x3b\x31\x39\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x31\x3b\x31\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x34\x3b\x31\x39\x37\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x36\x3b\x32\x30\x33\x3b\x32\x30\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x3b\x31\x35\x30\x3b\x31\x36\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x39\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x33\x3b\x31\x38\x38\x3b\x31\x39\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x38\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x31\x3b\x31\x37\x39\x3b\x31\x38\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x37\x3b\x32\x31\x36\x3b\x32\x32\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x33\x3b\x31\x33\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x33\x3b\x31\x37\x34\x3b\x31\x38\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x38\x30\x3b\x32\x32\x31\x3b\x32\x32\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x37\x3b\x32\x34\x32\x3b\x32\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x37\x3b\x31\x38\x36\x3b\x31\x39\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x33\x3b\x31\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x35\x3b\x32\x31\x35\x3b\x32\x31\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x30\x3b\x31\x37\x31\x3b\x31\x38\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x38\x3b\x31\x35\x36\x3b\x31\x36\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x37\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x3b\x31\x34\x38\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x38\x3b\x31\x35\x39\x3b\x31\x37\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x39\x3b\x31\x34\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x39\x3b\x31\x38\x34\x3b\x31\x39\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x31\x3b\x32\x33\x35\x3b\x32\x33\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x33\x3b\x31\x36\x31\x3b\x31\x37\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x35\x35\x3b\x32\x31\x31\x3b\x32\x31\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x32\x38\x3b\x31\x34\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x38\x3b\x31\x37\x37\x3b\x31\x38\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x38\x3b\x31\x38\x33\x3b\x31\x39\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x30\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x38\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x30\x3b\x32\x31\x38\x3b\x32\x32\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x32\x3b\x31\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x38\x3b\x31\x36\x39\x3b\x31\x37\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x36\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x30\x3b\x32\x33\x31\x3b\x32\x33\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x37\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x32\x3b\x32\x32\x33\x3b\x32\x32\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x36\x3b\x31\x36\x39\x3b\x31\x37\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x31\x3b\x31\x38\x39\x3b\x31\x39\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x34\x3b\x31\x39\x31\x3b\x31\x39\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x31\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x31\x3b\x32\x34\x33\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x35\x3b\x32\x30\x36\x3b\x32\x31\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x38\x3b\x32\x30\x37\x3b\x32\x31\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x39\x3b\x32\x32\x38\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x30\x3b\x32\x32\x38\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x31\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x33\x3b\x31\x35\x39\x3b\x31\x37\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x38\x3b\x32\x35\x32\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x34\x3b\x32\x31\x30\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x37\x3b\x32\x31\x31\x3b\x32\x31\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x32\x3b\x32\x31\x38\x3b\x32\x32\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x34\x3b\x32\x31\x36\x3b\x32\x32\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x32\x3b\x32\x34\x37\x3b\x32\x34\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x35\x3b\x31\x36\x38\x3b\x31\x37\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x38\x3b\x31\x36\x39\x3b\x31\x37\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x33\x3b\x31\x38\x31\x3b\x31\x38\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x37\x3b\x31\x37\x34\x3b\x31\x38\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x39\x3b\x32\x33\x34\x3b\x32\x33\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x31\x3b\x32\x33\x38\x3b\x32\x34\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x35\x3b\x32\x35\x32\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x34\x3b\x32\x30\x36\x3b\x32\x31\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x39\x3b\x32\x30\x35\x3b\x32\x31\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x30\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x32\x3b\x32\x32\x39\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x34\x3b\x32\x32\x32\x3b\x32\x32\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x30\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x34\x3b\x31\x36\x30\x3b\x31\x37\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x3b\x31\x35\x33\x3b\x31\x36\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x39\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x31\x3b\x32\x30\x37\x3b\x32\x31\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x36\x3b\x32\x33\x30\x3b\x32\x33\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x32\x36\x3b\x32\x33\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x33\x3b\x32\x35\x32\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x38\x3b\x32\x30\x36\x3b\x32\x31\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x36\x3b\x32\x33\x34\x3b\x32\x33\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x33\x3b\x31\x36\x33\x3b\x31\x37\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x37\x3b\x32\x30\x37\x3b\x32\x31\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x34\x37\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x33\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x35\x3b\x32\x35\x31\x3b\x32\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x30\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x32\x3b\x32\x31\x35\x3b\x32\x31\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x37\x3b\x32\x34\x39\x3b\x32\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x31\x3b\x32\x32\x37\x3b\x32\x33\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x31\x3b\x32\x34\x37\x3b\x32\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x36\x3b\x32\x30\x30\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x38\x3b\x32\x31\x36\x3b\x32\x32\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x33\x3b\x31\x39\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x39\x3b\x32\x30\x38\x3b\x32\x31\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x32\x3b\x32\x32\x37\x3b\x32\x33\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x33\x3b\x32\x34\x33\x3b\x32\x34\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x39\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x31\x3b\x31\x39\x34\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x34\x3b\x32\x33\x36\x3b\x32\x33\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x38\x35\x3b\x31\x37\x38\x3b\x31\x38\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x3b\x31\x34\x38\x3b\x31\x36\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x32\x3b\x31\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x33\x3b\x31\x35\x38\x3b\x31\x36\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x38\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x36\x3b\x32\x32\x38\x3b\x32\x33\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x34\x3b\x32\x34\x38\x3b\x32\x34\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x30\x30\x3b\x32\x31\x39\x3b\x32\x32\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x3b\x31\x39\x39\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x32\x3b\x32\x34\x35\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x38\x37\x3b\x32\x31\x36\x3b\x32\x32\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x39\x3b\x32\x31\x33\x3b\x32\x31\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x33\x3b\x32\x34\x33\x3b\x32\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x39\x38\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x30\x3b\x32\x31\x37\x3b\x32\x32\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x38\x3b\x32\x34\x37\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x30\x3b\x32\x34\x30\x3b\x32\x34\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x31\x3b\x31\x38\x30\x3b\x31\x38\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x30\x36\x3b\x32\x33\x32\x3b\x32\x33\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x37\x35\x3b\x31\x37\x34\x3b\x31\x38\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x36\x30\x3b\x31\x37\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x39\x30\x3b\x31\x39\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x35\x39\x3b\x31\x37\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x32\x30\x33\x3b\x32\x30\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x32\x30\x32\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x31\x3b\x32\x32\x34\x3b\x32\x32\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x3b\x32\x30\x32\x3b\x32\x30\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x35\x3b\x32\x35\x30\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x39\x3b\x32\x32\x39\x3b\x32\x33\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x30\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x35\x3b\x32\x32\x33\x3b\x32\x32\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x31\x3b\x31\x36\x32\x3b\x31\x37\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x36\x30\x3b\x32\x31\x31\x3b\x32\x31\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x32\x3b\x31\x35\x34\x3b\x31\x36\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x34\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x34\x3b\x31\x35\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x35\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x3b\x31\x35\x31\x3b\x31\x36\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x35\x3b\x32\x34\x36\x3b\x32\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x38\x3b\x32\x30\x31\x3b\x32\x30\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x37\x3b\x32\x35\x31\x3b\x32\x35\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x37\x37\x3b\x32\x33\x37\x3b\x32\x34\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x30\x3b\x32\x30\x36\x3b\x32\x31\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x34\x3b\x32\x35\x32\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x32\x3b\x32\x32\x36\x3b\x32\x33\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x3b\x32\x30\x31\x3b\x32\x30\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x32\x30\x30\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x37\x3b\x32\x32\x38\x3b\x32\x33\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x36\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x32\x3b\x32\x30\x37\x3b\x32\x31\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x34\x3b\x32\x33\x36\x3b\x32\x34\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x39\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x34\x3b\x32\x35\x32\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x33\x35\x3b\x32\x32\x37\x3b\x32\x33\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x37\x3b\x32\x31\x32\x3b\x32\x31\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x31\x3b\x32\x30\x37\x3b\x32\x31\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x37\x36\x3b\x31\x38\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x32\x3b\x32\x30\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x32\x30\x32\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x32\x30\x32\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x31\x3b\x32\x30\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x35\x3b\x32\x30\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x32\x30\x32\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x31\x3b\x31\x39\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x32\x30\x30\x3b\x32\x30\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x36\x30\x3b\x31\x37\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x3b\x31\x38\x38\x3b\x31\x39\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x32\x3b\x32\x34\x33\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x32\x3b\x31\x36\x32\x3b\x31\x37\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x30\x3b\x32\x31\x37\x3b\x32\x32\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x34\x36\x3b\x32\x35\x30\x3b\x32\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x32\x37\x3b\x31\x39\x37\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x39\x3b\x32\x33\x38\x3b\x32\x34\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x32\x3b\x31\x38\x31\x3b\x31\x38\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x32\x3b\x31\x35\x39\x3b\x31\x37\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x30\x3b\x32\x31\x36\x3b\x32\x32\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x31\x3b\x31\x37\x31\x3b\x31\x38\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x31\x31\x3b\x32\x33\x35\x3b\x32\x33\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x32\x33\x3b\x32\x34\x37\x3b\x32\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x39\x38\x3b\x32\x31\x39\x3b\x32\x32\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x39\x35\x3b\x32\x34\x31\x3b\x32\x34\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x39\x3b\x32\x31\x30\x3b\x32\x31\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x37\x3b\x32\x31\x34\x3b\x32\x32\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x36\x3b\x32\x30\x38\x3b\x32\x31\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x35\x3b\x32\x32\x33\x3b\x32\x32\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x31\x3b\x31\x39\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x37\x38\x3b\x32\x32\x34\x3b\x32\x32\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x36\x35\x3b\x31\x37\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x37\x3b\x31\x36\x33\x3b\x31\x37\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x33\x3b\x31\x37\x34\x3b\x31\x38\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x37\x3b\x31\x36\x33\x3b\x31\x37\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x35\x3b\x31\x34\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x30\x3b\x31\x35\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x39\x39\x3b\x31\x38\x34\x3b\x31\x39\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x3b\x31\x34\x39\x3b\x31\x36\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x32\x36\x3b\x32\x34\x31\x3b\x32\x34\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x33\x36\x3b\x32\x30\x31\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x34\x35\x3b\x32\x35\x31\x3b\x32\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x36\x3b\x32\x33\x32\x3b\x32\x33\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x30\x3b\x32\x30\x34\x3b\x32\x31\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x35\x3b\x32\x35\x30\x3b\x32\x35\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x30\x39\x3b\x32\x32\x31\x3b\x32\x32\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x35\x3b\x31\x39\x38\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x36\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x39\x3b\x32\x30\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x32\x30\x30\x3b\x32\x30\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x38\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x36\x3b\x32\x30\x32\x3b\x32\x30\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x35\x3b\x32\x30\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x39\x3b\x32\x33\x30\x3b\x32\x33\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x36\x38\x3b\x32\x31\x32\x3b\x32\x31\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x38\x3b\x32\x34\x32\x3b\x32\x34\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x35\x37\x3b\x32\x31\x30\x3b\x32\x31\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x37\x3b\x31\x35\x32\x3b\x31\x36\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x33\x33\x3b\x32\x34\x35\x3b\x32\x34\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x37\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x31\x31\x3b\x31\x38\x39\x3b\x31\x39\x37\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x3b\x31\x34\x35\x3b\x31\x35\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x31\x3b\x31\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x38\x3b\x31\x35\x31\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x3b\x31\x34\x36\x3b\x31\x35\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x33\x3b\x31\x34\x35\x3b\x31\x35\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x34\x33\x3b\x31\x35\x36\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x34\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x34\x32\x3b\x31\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x3b\x31\x35\x31\x3b\x31\x36\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x36\x3b\x31\x35\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x34\x39\x3b\x32\x30\x36\x3b\x32\x31\x32\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x35\x36\x3b\x31\x36\x34\x3b\x31\x37\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x32\x3b\x32\x32\x36\x3b\x32\x32\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x30\x35\x3b\x32\x34\x33\x3b\x32\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x37\x3b\x32\x31\x34\x3b\x32\x32\x30\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x39\x37\x3b\x32\x30\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x39\x3b\x32\x34\x30\x3b\x32\x34\x33\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x34\x3b\x32\x30\x30\x3b\x32\x30\x37\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x38\x3b\x32\x34\x36\x3b\x32\x34\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x34\x3b\x32\x32\x32\x3b\x32\x32\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x33\x3b\x32\x34\x39\x3b\x32\x35\x31\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x39\x39\x3b\x32\x33\x30\x3b\x32\x33\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x37\x34\x3b\x31\x37\x33\x3b\x31\x38\x32\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x30\x3b\x31\x33\x39\x3b\x31\x35\x33\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x31\x38\x39\x3b\x32\x32\x34\x3b\x32\x32\x38\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x3b\x31\x34\x36\x3b\x31\x35\x39\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x31\x33\x3b\x32\x33\x36\x3b\x32\x33\x39\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x31\x31\x32\x3b\x31\x39\x30\x3b\x31\x39\x38\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x33\x33\x3b\x32\x34\x35\x3b\x32\x34\x36\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x31\x3b\x32\x35\x33\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x33\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x34\x3b\x32\x35\x34\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x34\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\x1b\x5b\x33\x38\x3b\x32\x3b\x32\x35\x35\x3b\x32\x35\x35\x3b\x32\x35\x35\x6d\xe2\x96\x84\x1b\x5b\x30\x6d\x0a"
typedef struct file_t {
int used;
FILE* ptr;
char* name;
char* buffer;
unsigned int size;
} file_t;
file_t files[FILES_COUNT];
void setup() {
setvbuf(stdin, NULL, _IONBF, 0);
setvbuf(stdout, NULL, _IONBF, 0);
setvbuf(stderr, NULL, _IONBF, 0);
alarm(TIMEOUT);
memset(files, 0, FILES_COUNT * sizeof(file_t));
puts(LOGO);
}
void print_menu() {
puts("Menu:");
puts("1. Open");
puts("2. Read");
puts("3. Close");
puts("4. Exit");
}
unsigned int read_uint() {
int result;
scanf("%u", &result);
getc(stdin);
return result;
}
char* read_string() {
char* buffer;
buffer = (char*)calloc(64 + 1, sizeof(char));
scanf("%64s", buffer);
getc(stdin);
return buffer;
}
unsigned int get_file_size(FILE* file) {
unsigned int size;
fseek(file, 0, SEEK_END);
size = ftell(file);
fseek(file, 0, SEEK_SET);
return size;
}
void open_file(unsigned int index) {
if (files[index].used) {
puts("File is already opened!");
return;
}
puts("Please, input a filename:");
files[index].name = read_string();
files[index].ptr = fopen(files[index].name, "r");
if (files[index].ptr == NULL) {
puts("Failed to open file!");
return;
}
files[index].size = get_file_size(files[index].ptr);
files[index].buffer = (char*)calloc(files[index].size + 1, sizeof(char));
files[index].used = 1;
puts("Successfully opened.");
}
void read_file(unsigned int index) {
unsigned int size;
if (!files[index].used) {
puts("File is not opened!");
return;
}
puts("Please, input a size:");
size = read_uint();
if (size > files[index].size) {
puts("Size is too big!");
return;
}
fseek(files[index].ptr, 0, SEEK_SET);
fread(files[index].buffer, sizeof(char), size, files[index].ptr);
fwrite(files[index].buffer, sizeof(char), size, stdout);
puts("Successfully read.");
}
void close_file(unsigned int index) {
if (!files[index].used) {
puts("File is not opened!");
return;
}
fclose(files[index].ptr);
free(files[index].name);
free(files[index].buffer);
memset(&files[index], 0, sizeof(file_t));
puts("Successfully closed.");
}
int main(int argc, char** argv, char** envp) {
unsigned int choice;
unsigned int index;
setup();
while (1) {
print_menu();
choice = read_uint();
if (choice == 1 || choice == 2 || choice == 3) {
puts("Please, input an index:");
index = read_uint();
if (index >= FILES_COUNT) {
puts("Index is too big!");
continue;
}
}
switch (choice) {
case 1:
open_file(index);
break;
case 2:
read_file(index);
break;
case 3:
close_file(index);
break;
case 4:
puts("Bye.");
return 0;
default:
puts("Invalid choice!");
break;
}
}
return 0;
}
|
the_stack_data/44890.c | /* PR 35503 - Warn about restricted pointers
Test to exercise that -Wrestrict warnings are issued for memory and
sring functions when they are declared in system headers (i.e., not
just when they are explicitly declared in the source file.)
Also verify that the warnings are issued even for calls where the
source of the aliasing violation is in a different function than
the restricted call.
{ dg-do compile }
{ dg-options "-O2 -Wrestrict" } */
#if __has_include (<stddef.h>)
# include <stddef.h>
#else
/* For cross-compilers. */
typedef __PTRDIFF_TYPE__ ptrdiff_t;
typedef __SIZE_TYPE__ size_t;
#endif
#if __has_include (<string.h>)
# include <string.h>
# undef memcpy
# undef strcat
# undef strcpy
# undef strncat
# undef strncpy
#else
extern void* memcpy (void*, const void*, size_t);
extern char* strcat (char*, const char*);
extern char* strcpy (char*, const char*);
extern char* strncat (char*, const char*, size_t);
extern char* strncpy (char*, const char*, size_t);
#endif
static void wrap_memcpy (void *d, const void *s, size_t n)
{
memcpy (d, s, n); /* { dg-warning "accessing 2 bytes at offsets 0 and 1 overlaps 1 byte at offset 1" "memcpy" } */
}
void call_memcpy (char *d)
{
const void *s = d + 1;
wrap_memcpy (d, s, 2);
}
static void wrap_strcat (char *d, const char *s)
{
strcat (d, s); /* { dg-warning "source argument is the same as destination" "strcat" } */
}
void call_strcat (char *d)
{
const char *s = d;
wrap_strcat (d, s);
}
static void wrap_strcpy (char *d, const char *s)
{
strcpy (d, s); /* { dg-warning "source argument is the same as destination" "strcpy" } */
}
void call_strcpy (char *d)
{
const char *s = d;
wrap_strcpy (d, s);
}
static void wrap_strncat (char *d, const char *s, size_t n)
{
strncat (d, s, n); /* { dg-warning "source argument is the same as destination" "strncat" } */
}
void call_strncat (char *d, size_t n)
{
const char *s = d;
wrap_strncat (d, s, n);
}
static void wrap_strncpy (char *d, const char *s, size_t n)
{
strncpy (d, s, n); /* { dg-warning "source argument is the same as destination" "strncpy" } */
}
void call_strncpy (char *d, size_t n)
{
const char *s = d;
wrap_strncpy (d, s, n);
}
|
the_stack_data/75137017.c | // Test that AddressSanitizer does not re-animate dead globals when dead
// stripping is turned on.
//
// This test verifies that an out-of-bounds access on a global variable is
// detected after dead stripping has been performed. This proves that the
// runtime is able to register globals in the __DATA,__asan_globals section.
// REQUIRES: osx-ld64-live_support
// RUN: %clang_asan -mmacosx-version-min=10.11 -mllvm -asan-globals-live-support -Xlinker -dead_strip -o %t %s
// RUN: llvm-nm -format=posix %t | FileCheck --check-prefix NM-CHECK %s
// RUN: not %run %t 2>&1 | FileCheck --check-prefix ASAN-CHECK %s
int alive[1] = {};
int dead[1] = {};
// NM-CHECK: {{^_alive }}
// NM-CHECK-NOT: {{^_dead }}
int main(int argc, char *argv[]) {
alive[argc] = 0;
// ASAN-CHECK: {{0x.* is located 0 bytes to the right of global variable}}
return 0;
}
|
the_stack_data/15750.c | #include <stdio.h>
// SCRIPT
int main() {
int n = 0;
int check = 0;
while ( check == 0 ) {
check = 1;
n += 20 * 19;
for (int m = 19; 1 <= m; --m) {
if ( n % m != 0 ) {
check = 0;
break;
}
}
}
printf("%d\n", n);
}
|
the_stack_data/192330487.c | #include <sys/types.h>
#include <sys/socket.h>
#include <arpa/inet.h>
#include <netinet/in.h>
#include <netinet/ip.h>
#include <netdb.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
int main(int argc, char ** argv){
if (argc != 2)
{
printf("Error de uso\n");
return -1;
}
struct in_addr inaddr;
struct addrinfo informacion;
struct addrinfo *resultado;
informacion.ai_flags = AI_PASSIVE;
informacion.ai_family = AF_UNSPEC;
informacion.ai_socktype = SOCK_STREAM;
informacion.ai_protocol = 0;
//informacion.ai_addrlen = 256;
informacion.ai_addr = NULL;
informacion.ai_canonname = NULL;
informacion.ai_next = NULL;
if(getaddrinfo("::",argv[1],&informacion,&resultado) != 0){
printf("Error al obtener direcciones\n");
return -1;
}
int sock = socket(resultado->ai_family, SOCK_STREAM, resultado->ai_protocol);
if(sock == -1){
printf("Socket caca\n");
return -1;
}
int on = 1;
int off = 0;
setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, (void*)&on,sizeof(int));
setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, (void*)&off,sizeof(int));
if (bind(sock, resultado->ai_addr, resultado->ai_addrlen ) == -1){
printf("Error en bind\n");
return -1;
}
printf("Socket binded\n");
freeaddrinfo(resultado);
if (listen(sock,12) == -1){
printf("Error en listen\n");
return -1;
}
char buf[256] = "";
struct sockaddr_storage msg;
socklen_t msglen = sizeof(msg);
pid_t pid = getpid();
while(pid){
int aceptado = accept(sock,&msg, &msglen );
if(aceptado == -1){
printf("Error al aceptar la conexion\n");
return -1;
}
char hostname[NI_MAXHOST+1] = "";
char port[NI_MAXSERV+1] = "";
if(-1 == getnameinfo(&msg,msglen,hostname, NI_MAXHOST+1, port, NI_MAXSERV+1,0)){
printf("Error al obtener nombre de host y puerto\n");
}
printf("Conexion desde %s puerto %s\n", hostname,port );
pid = fork();
if (pid == -1){
printf("No se pudo realizar fork()\n");
close(aceptado);
close(sock);
return -1;
}
if (pid == 0){
ssize_t tammsg;
do{
tammsg = recv(aceptado, buf, 256*sizeof(char), 0);
printf("%i\n", tammsg );
printf("%s\n", buf );
if(tammsg ==-1){
printf("Error, mensaje demasiado largo\n");
}
else{
buf[tammsg] = '\0';
ssize_t envio = send(aceptado, buf, (tammsg+1)*sizeof(char), 0);
if (envio == -1)
printf("Fallo al enviar el mensaje\n");
}
if (tammsg == 0){
printf("Finalizando conexion\n");
}
}while (tammsg >0);
}
close (aceptado);
}
close(sock);
return 0;
} |
the_stack_data/32016.c | /*
** EPITECH PROJECT, 2019
** my_strlowcase
** File description:
** Function that lowcase all letters
*/
char *my_strlowcase(char *str)
{
for (int i = 0; str[i] != '\0'; i++) {
if (str[i] >= 'A' && str[i] <= 'Z') {
str[i] += 32;
}
}
return (str);
} |
the_stack_data/76700370.c | //
// Created by 詹国煌 on 2020/11/9.
//
#include <stdio.h>
#define MAXLINE 1000
int getLine(char line[], int maxline);
void copy(char to[], char from[]);
main() {
int len;
int max;
char line[MAXLINE];
char longest[MAXLINE];
max = 0;
while ((len = getLine(line, MAXLINE))> 0) {
if (len > max) {
max = len;
copy(longest, line);
}
}
if (max > 0) {
printf("%s", longest);
}
return 0;
}
int getLine(char s[], int lim) {
int c, i;
for (i=0; i < lim - 1 && (c=getchar()) != EOF && c != '\n'; ++i) {
s[i] = c;
}
if (c == '\n') {
s[i] = c;
++i;
}
s[i]= '\0';
return i;
}
void copy(char to[], char from[]) {
int i;
i = 0;
while ((to[i] = from[i]) != '\0')
++i;
} |
the_stack_data/29826196.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char name[100];
char *description;
strcpy(name, "Zara Ali");
/* allocate memory dynamically */
description = malloc( 30 * sizeof(char) );
if( description == NULL ) {
fprintf(stderr, "Error - unable to allocate required memory\n");
} else {
strcpy( description, "Zara ali a DPS student.");
}
/* suppose you want to store bigger description */
description = realloc( description, 100 * sizeof(char) );
if( description == NULL ) {
fprintf(stderr, "Error - unable to allocate required memory\n");
} else {
strcat( description, "She is in class 10th");
}
printf("Name = %s\n", name );
printf("Description: %s\n", description );
/* release memory using free() function */
free(description);
}
|
the_stack_data/151075.c | /* -*- mode: c -*-
* $Id: Ackermann.c,v 1.1 2003/01/31 11:07:02 djowel Exp $
* http://www.bagley.org/~doug/shootout/
*/
//#include <stdio.h>
//#include <stdlib.h>
//#include <unistd.h>
int Ack(int M, int N) { return(M ? (Ack(M-1,N ? Ack(M,(N-1)) : 1)) : N+1); }
int main(int argc, char *argv[]) {
int n = ((argc == 2) ? atoi(argv[1]) : 1);
printf("Ack(3,%d): %d\n", n, Ack(3, n));
/* sleep long enough so we can measure memory usage */
sleep(1);
return(0);
}
|
the_stack_data/34511875.c | #include<stdio.h>
main()
{
int c, prev_space;
if((c = getchar()) != EOF) {
if(c == '\t')
c = ' ';
if(c != ' ')
prev_space = 0;
if(c == ' ')
prev_space = 1;
putchar(c);
}
while((c = getchar()) != EOF) {
if(prev_space == 0) {
if(c == '\t')
c = ' ';
if(c == ' ')
prev_space = 1;
putchar(c);
}
if(prev_space == 1) {
if(c == '\t')
c = ' ';
if(c != ' ') {
prev_space = 0;
putchar(c);
}
}
}
}
|
the_stack_data/125140794.c | #include <stdio.h>
#include <math.h>
int main() {
int n, l, h, c;
while (scanf("%d%d%d%d", &n, &h, &c, &l) != EOF) {
printf("%.4lf\n", (sqrt(h*h + c*c) * l * n)/10000);
}
return 0;
}
|
the_stack_data/756483.c | #include <stdio.h>
#include <stdlib.h>
#define MAX 100
typedef struct {
int val;
int cnt;
} NodeType;
int main()
{
void printAll(NodeType** tbl, int elements);
int binarySearch(NodeType** tbl, int key, int elements);
void insertInPlace(NodeType** tbl, int key, int* elements);
NodeType *numbers[MAX]; // An array of pointers.
NodeType *new;
int total = 0; // Total number of entries in the numbers[]
int rply = 2;
int index;
printf("This program asks for integers one at a time. \n");
printf("It calculates the frequency of all the numbers.\n");
printf("To terminate the feeding phase insert a zero.\n\n");
// Add some extra elements to speed up development.
// Remove these when ready.
//
while(rply) {
printf("Next number: ");
scanf("%d",&rply);
if(total == 0) { // Add the first element
new = (NodeType*) malloc(sizeof(NodeType));
new->val = rply;
new->cnt = 1;
numbers[0] = new;
total = 1;
} else {
index = binarySearch(numbers, rply, total);
if(index < 0) {
insertInPlace(numbers, rply, &total);
} else {
((numbers[index])->cnt)++; // Increment the # of the occurences.
}
}
printAll(numbers,total);
} // while(rply)
printf("\n\n");
printAll(numbers,total);
printf("\n\nAsk frequencies of numbers. Terminate by entering a zero.\n\n");
rply = 2; // Make non-zero to get going.
while(rply) {
printf("Next number: ");
scanf("%d",&rply);
index = binarySearch(numbers, rply, total);
if(index < 0) {
printf("%d has 0 occurences.\n",rply);
} else {
printf("%d has %d occurences.\n",rply,numbers[index]->cnt);
}
}
return 0;
}
//------------------------------ printAll ------------------------------
void printAll(NodeType** tbl, int elements) {
int i;
for(i=0;i<elements;i++) {
printf("%d : %d\n",(*(tbl+i))->val,(*(tbl+i))->cnt);
}
return;
}
//------------------------------ binarySearch ------------------------------
int binarySearch(NodeType** tbl, int key, int elements) {
/*This function searches for the key in the table. If it finds the key,
* it returns the index of key in the array tbl otherwise it returns -1.*/
int lo = 0;
int hi = elements - 1;
int mid;
NodeType** curr; // Pointer to the node to look at next
while(lo <= hi) {
mid = (hi + lo) / 2;
curr = tbl + mid; // Pointer arithmetics !
if(key == (*curr)->val) return mid; // found
if(key < (*curr)->val) hi = mid - 1;
else lo = mid + 1;
}
return -1;
}
//------------------------------ insertInPlace ------------------------------
void insertInPlace(NodeType** tbl, int key, int* elements) {
/* This function insert the new element 'key' into the existing array tbl
* so that after the insertion the number of elements has been increased by
* one and the elements are in the ascending order. */
NodeType* newNode = (NodeType*) malloc(sizeof(NodeType));
int k = *elements - 1; // k points at the last element of the tbl.
while(k >= 0 && key < (*(tbl +k))->val) {
tbl[k+1] = tbl[k];
k--;
}
tbl[k+1] = newNode;
(tbl[k+1])->val = key;
(tbl[k+1])->cnt = 1;
(*elements)++;
}
|
the_stack_data/243894378.c | //+--------------------------------------------------------------------------
//
// THIS CODE AND INFORMATION IS PROVIDED "AS IS" WITHOUT WARRANTY OF
// ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING BUT NOT LIMITED TO
// THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
// PARTICULAR PURPOSE.
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// Abstract:
// Wrapper for dlldata.c setting REGISTER_PROXY_DLL to build
// interface proxies
//
//----------------------------------------------------------------------------
//
// merge proxy stub DLL
//
#ifdef _MERGE_PROXYSTUB
//
// DllRegisterServer, etc.
//
#define REGISTER_PROXY_DLL
#ifndef _WIN32_WINNT
#define _WIN32_WINNT 0x0600 // Windows Vista or higher.
#endif
#ifndef NTDDI_VERSION
#define NTDDI_VERSION NTDDI_LONGHORN // Windows Vista or higher.
#endif
#define USE_STUBLESS_PROXY
#pragma comment(lib, "rpcns4.lib")
#pragma comment(lib, "rpcrt4.lib")
#define ENTRY_PREFIX Prx
#include "dlldata.c"
#include "DeviceModelPluginSample_p.c"
#endif
|
the_stack_data/18887103.c | /* comp - compare two files
* Converted from the BDS C version
* by Stefano Bodrato - 27/3/2012
*
* zcc +osca -lflosxdos comp.c
*
* $Id: comp.c,v 1.1 2012/03/22 09:55:48 stefano Exp $
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <string.h>
#include <ctype.h>
#define SECTOR_SIZE 512
int line = 1, block = 0, lflag = 0, pflag=0, charn = -1;
long pos=-1L;
FILE *f1;
FILE *f2;
int x,c,d;
char fn1[30];
char fn2[30];
main(int argc, char *argv[])
{
if ((argc < 3) || (argc > 4)) {
printf("Usage: COMP [/L] file1 file2\n");
exit(0);
}
for (x=1; x<argc; x++) {
if (strcmp(argv[x],"/L")==0) lflag++;
else {
if (pflag==0) {
strcpy(fn1,argv[x]);
f1=fopen(fn1,"rb");
pflag++;
} else {
strcpy(fn2,argv[x]);
f2=fopen(fn2,"rb");
}
}
}
if (f1==NULL) {
printf("Can't open first file: %s\n",fn1);
exit(0);
}
if (f2==NULL) {
printf("Can't open second file: %s\n",fn2);
exit(0);
}
while (1) {
if (++charn == SECTOR_SIZE) { block++ ;charn = 0; }
pos++;
c = getc(f1); d = getc(f2);
if (c == '\n') line++;
if (c == d) {
if (c < 0) {
if (lflag <= 1)
printf("Files are identical.\n");
exit(0); }
continue; }
if (c < 0) {printf("%s is shorter.\n",fn1); exit(0); }
if (d < 0) {printf("%s is shorter.\n",fn2); exit(0); }
if (lflag) {
printf("%s pos %lu char %u block %u line %u = %u; %s = %u\n",
fn1,pos,charn,block,line,c,fn2,d);
lflag = 2;
continue; }
printf("Files differ at position %lu, character %u, block %u, line %u.\n",
pos,charn,block,line);
exit(0); }
}
|
the_stack_data/215769333.c | /*
* FreeRTOS V202112.00
* Copyright (C) 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
* the Software, and to permit persons to whom the Software is furnished to do so,
* subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
* COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* https://www.FreeRTOS.org
* https://aws.amazon.com/freertos
*
*/
/*
* "Reg test" tasks - These fill the registers with known values, then check
* that each register maintains its expected value for the lifetime of the
* task. Each task uses a different set of values. The reg test tasks execute
* with a very low priority, so get preempted very frequently. A register
* containing an unexpected value is indicative of an error in the context
* switching mechanism.
*/
void vRegTest1Implementation( void ) __attribute__ ((naked));
void vRegTest2Implementation( void ) __attribute__ ((naked));
void vRegTest1Implementation( void )
{
__asm volatile
(
".extern ulRegTest1LoopCounter \n"
/* Fill the core registers with known values. */
"mov r0, #100 \n"
"mov r1, #101 \n"
"mov r2, #102 \n"
"mov r3, #103 \n"
"mov r4, #104 \n"
"mov r5, #105 \n"
"mov r6, #106 \n"
"mov r7, #107 \n"
"mov r8, #108 \n"
"mov r9, #109 \n"
"mov r10, #110 \n"
"mov r11, #111 \n"
"mov r12, #112 \n"
/* Fill the VFP registers with known values. */
"vmov d0, r0, r1 \n"
"vmov d1, r2, r3 \n"
"vmov d2, r4, r5 \n"
"vmov d3, r6, r7 \n"
"vmov d4, r8, r9 \n"
"vmov d5, r10, r11 \n"
"vmov d6, r0, r1 \n"
"vmov d7, r2, r3 \n"
"vmov d8, r4, r5 \n"
"vmov d9, r6, r7 \n"
"vmov d10, r8, r9 \n"
"vmov d11, r10, r11 \n"
"vmov d12, r0, r1 \n"
"vmov d13, r2, r3 \n"
"vmov d14, r4, r5 \n"
"vmov d15, r6, r7 \n"
"reg1_loop: \n"
/* Check all the VFP registers still contain the values set above.
First save registers that are clobbered by the test. */
"push { r0-r1 } \n"
"vmov r0, r1, d0 \n"
"cmp r0, #100 \n"
"bne reg1_error_loopf \n"
"cmp r1, #101 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d1 \n"
"cmp r0, #102 \n"
"bne reg1_error_loopf \n"
"cmp r1, #103 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d2 \n"
"cmp r0, #104 \n"
"bne reg1_error_loopf \n"
"cmp r1, #105 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d3 \n"
"cmp r0, #106 \n"
"bne reg1_error_loopf \n"
"cmp r1, #107 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d4 \n"
"cmp r0, #108 \n"
"bne reg1_error_loopf \n"
"cmp r1, #109 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d5 \n"
"cmp r0, #110 \n"
"bne reg1_error_loopf \n"
"cmp r1, #111 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d6 \n"
"cmp r0, #100 \n"
"bne reg1_error_loopf \n"
"cmp r1, #101 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d7 \n"
"cmp r0, #102 \n"
"bne reg1_error_loopf \n"
"cmp r1, #103 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d8 \n"
"cmp r0, #104 \n"
"bne reg1_error_loopf \n"
"cmp r1, #105 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d9 \n"
"cmp r0, #106 \n"
"bne reg1_error_loopf \n"
"cmp r1, #107 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d10 \n"
"cmp r0, #108 \n"
"bne reg1_error_loopf \n"
"cmp r1, #109 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d11 \n"
"cmp r0, #110 \n"
"bne reg1_error_loopf \n"
"cmp r1, #111 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d12 \n"
"cmp r0, #100 \n"
"bne reg1_error_loopf \n"
"cmp r1, #101 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d13 \n"
"cmp r0, #102 \n"
"bne reg1_error_loopf \n"
"cmp r1, #103 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d14 \n"
"cmp r0, #104 \n"
"bne reg1_error_loopf \n"
"cmp r1, #105 \n"
"bne reg1_error_loopf \n"
"vmov r0, r1, d15 \n"
"cmp r0, #106 \n"
"bne reg1_error_loopf \n"
"cmp r1, #107 \n"
"bne reg1_error_loopf \n"
/* Restore the registers that were clobbered by the test. */
"pop {r0-r1} \n"
/* VFP register test passed. Jump to the core register test. */
"b reg1_loopf_pass \n"
"reg1_error_loopf: \n"
/* If this line is hit then a VFP register value was found to be
incorrect. */
"b reg1_error_loopf \n"
"reg1_loopf_pass: \n"
"cmp r0, #100 \n"
"bne reg1_error_loop \n"
"cmp r1, #101 \n"
"bne reg1_error_loop \n"
"cmp r2, #102 \n"
"bne reg1_error_loop \n"
"cmp r3, #103 \n"
"bne reg1_error_loop \n"
"cmp r4, #104 \n"
"bne reg1_error_loop \n"
"cmp r5, #105 \n"
"bne reg1_error_loop \n"
"cmp r6, #106 \n"
"bne reg1_error_loop \n"
"cmp r7, #107 \n"
"bne reg1_error_loop \n"
"cmp r8, #108 \n"
"bne reg1_error_loop \n"
"cmp r9, #109 \n"
"bne reg1_error_loop \n"
"cmp r10, #110 \n"
"bne reg1_error_loop \n"
"cmp r11, #111 \n"
"bne reg1_error_loop \n"
"cmp r12, #112 \n"
"bne reg1_error_loop \n"
/* Everything passed, increment the loop counter. */
"push { r0-r1 } \n"
"ldr r0, =ulRegTest1LoopCounter \n"
"ldr r1, [r0] \n"
"adds r1, r1, #1 \n"
"str r1, [r0] \n"
"pop { r0-r1 } \n"
/* Start again. */
"b reg1_loop \n"
"reg1_error_loop: \n"
/* If this line is hit then there was an error in a core register value.
The loop ensures the loop counter stops incrementing. */
"b reg1_error_loop \n"
"nop \n"
); /* __asm volatile. */
}
/*-----------------------------------------------------------*/
void vRegTest2Implementation( void )
{
__asm volatile
(
".extern ulRegTest2LoopCounter \n"
/* Set all the core registers to known values. */
"mov r0, #-1 \n"
"mov r1, #1 \n"
"mov r2, #2 \n"
"mov r3, #3 \n"
"mov r4, #4 \n"
"mov r5, #5 \n"
"mov r6, #6 \n"
"mov r7, #7 \n"
"mov r8, #8 \n"
"mov r9, #9 \n"
"mov r10, #10 \n"
"mov r11, #11 \n"
"mov r12, #12 \n"
/* Set all the VFP to known values. */
"vmov d0, r0, r1 \n"
"vmov d1, r2, r3 \n"
"vmov d2, r4, r5 \n"
"vmov d3, r6, r7 \n"
"vmov d4, r8, r9 \n"
"vmov d5, r10, r11 \n"
"vmov d6, r0, r1 \n"
"vmov d7, r2, r3 \n"
"vmov d8, r4, r5 \n"
"vmov d9, r6, r7 \n"
"vmov d10, r8, r9 \n"
"vmov d11, r10, r11 \n"
"vmov d12, r0, r1 \n"
"vmov d13, r2, r3 \n"
"vmov d14, r4, r5 \n"
"vmov d15, r6, r7 \n"
"reg2_loop: \n"
/* Check all the VFP registers still contain the values set above.
First save registers that are clobbered by the test. */
"push { r0-r1 } \n"
"vmov r0, r1, d0 \n"
"cmp r0, #-1 \n"
"bne reg2_error_loopf \n"
"cmp r1, #1 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d1 \n"
"cmp r0, #2 \n"
"bne reg2_error_loopf \n"
"cmp r1, #3 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d2 \n"
"cmp r0, #4 \n"
"bne reg2_error_loopf \n"
"cmp r1, #5 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d3 \n"
"cmp r0, #6 \n"
"bne reg2_error_loopf \n"
"cmp r1, #7 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d4 \n"
"cmp r0, #8 \n"
"bne reg2_error_loopf \n"
"cmp r1, #9 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d5 \n"
"cmp r0, #10 \n"
"bne reg2_error_loopf \n"
"cmp r1, #11 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d6 \n"
"cmp r0, #-1 \n"
"bne reg2_error_loopf \n"
"cmp r1, #1 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d7 \n"
"cmp r0, #2 \n"
"bne reg2_error_loopf \n"
"cmp r1, #3 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d8 \n"
"cmp r0, #4 \n"
"bne reg2_error_loopf \n"
"cmp r1, #5 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d9 \n"
"cmp r0, #6 \n"
"bne reg2_error_loopf \n"
"cmp r1, #7 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d10 \n"
"cmp r0, #8 \n"
"bne reg2_error_loopf \n"
"cmp r1, #9 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d11 \n"
"cmp r0, #10 \n"
"bne reg2_error_loopf \n"
"cmp r1, #11 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d12 \n"
"cmp r0, #-1 \n"
"bne reg2_error_loopf \n"
"cmp r1, #1 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d13 \n"
"cmp r0, #2 \n"
"bne reg2_error_loopf \n"
"cmp r1, #3 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d14 \n"
"cmp r0, #4 \n"
"bne reg2_error_loopf \n"
"cmp r1, #5 \n"
"bne reg2_error_loopf \n"
"vmov r0, r1, d15 \n"
"cmp r0, #6 \n"
"bne reg2_error_loopf \n"
"cmp r1, #7 \n"
"bne reg2_error_loopf \n"
/* Restore the registers that were clobbered by the test. */
"pop {r0-r1} \n"
/* VFP register test passed. Jump to the core register test. */
"b reg2_loopf_pass \n"
"reg2_error_loopf: \n"
/* If this line is hit then a VFP register value was found to be
incorrect. */
"b reg2_error_loopf \n"
"reg2_loopf_pass: \n"
"cmp r0, #-1 \n"
"bne reg2_error_loop \n"
"cmp r1, #1 \n"
"bne reg2_error_loop \n"
"cmp r2, #2 \n"
"bne reg2_error_loop \n"
"cmp r3, #3 \n"
"bne reg2_error_loop \n"
"cmp r4, #4 \n"
"bne reg2_error_loop \n"
"cmp r5, #5 \n"
"bne reg2_error_loop \n"
"cmp r6, #6 \n"
"bne reg2_error_loop \n"
"cmp r7, #7 \n"
"bne reg2_error_loop \n"
"cmp r8, #8 \n"
"bne reg2_error_loop \n"
"cmp r9, #9 \n"
"bne reg2_error_loop \n"
"cmp r10, #10 \n"
"bne reg2_error_loop \n"
"cmp r11, #11 \n"
"bne reg2_error_loop \n"
"cmp r12, #12 \n"
"bne reg2_error_loop \n"
/* Increment the loop counter to indicate this test is still functioning
correctly. */
"push { r0-r1 } \n"
"ldr r0, =ulRegTest2LoopCounter \n"
"ldr r1, [r0] \n"
"adds r1, r1, #1 \n"
"str r1, [r0] \n"
/* Yield to increase test coverage. */
"movs r0, #0x01 \n"
"ldr r1, =0xe000ed04 \n" /*NVIC_INT_CTRL */
"lsl r0, r0, #28 \n" /* Shift to PendSV bit */
"str r0, [r1] \n"
"dsb \n"
"pop { r0-r1 } \n"
/* Start again. */
"b reg2_loop \n"
"reg2_error_loop: \n"
/* If this line is hit then there was an error in a core register value.
This loop ensures the loop counter variable stops incrementing. */
"b reg2_error_loop \n"
); /* __asm volatile */
}
/*-----------------------------------------------------------*/
|
the_stack_data/451828.c | #include <unistd.h>
int main(int argc, char *argv[])
{
int i;
i = 1;
while (i < argc)
{
while (*argv[i])
write(1, argv[i]++, 1);
write(1, "\n", 1);
++i;
}
return (0);
}
|
the_stack_data/154831092.c | /*
* chap07/lecture-examples.c (c) 2021 Christopher A. Bohn
*/
#include <stdio.h>
#include <unistd.h>
void orphan_demo();
void orphan_demo() {
if (fork()) {
printf("Parent process (%d) terminating.\n", getpid());
} else {
printf("Child process (%d) running.\n", getpid());
while(1);
}
}
int main() {
orphan_demo();
return 0;
}
|
the_stack_data/122014502.c | typedef struct
{
unsigned short b0, b1, b2, b3;
} four_quarters;
four_quarters x;
int a, b;
void f (four_quarters j)
{
b = j.b2;
a = j.b3;
}
main ()
{
four_quarters x;
x.b0 = x.b1 = x.b2 = 0;
x.b3 = 38;
f(x);
if (a != 38)
abort();
exit (0);
}
|
the_stack_data/211081256.c | #include <stdio.h>
#include <stdlib.h>
//트리 노드 정의
typedef struct TreeNode{
char ele;
struct TreeNode *left;
struct TreeNode *right;
}TreeNode;
//새로운 노드 생성
TreeNode *New_TreeNode(char data)
{
TreeNode *New = (TreeNode*)malloc(sizeof(TreeNode));
New->ele = data;
New->left = NULL; New->right = NULL;
return New;
}
//트리 검색 함수
TreeNode *Search_TreeNode(TreeNode *TN, char data)
{
if(TN != NULL)
{
if(TN->ele == data)
return TN;
else
{
TreeNode *temp = Search_TreeNode(TN->left, data);
if(temp != NULL)
return temp;
return Search_TreeNode(TN->right, data);
}
}
return NULL;
}
//data1이 부모 노드, data2가 왼쪽 자식 노드, data3가 오른쪽 자식 노드
void Insert_TreeNode(TreeNode *TN, char data1, char data2, char data3)
{
TN->ele = data1;
if(data2 != '.')
TN->left = New_TreeNode(data2);
if(data3 != '.')
TN->right = New_TreeNode(data3);
}
//전위 순회
void Preorder_Traversal(TreeNode *TN)
{
if(TN == NULL)
return;
printf("%c",TN->ele);
Preorder_Traversal(TN->left);
Preorder_Traversal(TN->right);
}
//중위 순회
void Inorder_Traversal(TreeNode *TN)
{
if(TN == NULL)
return;
Inorder_Traversal(TN->left);
printf("%c",TN->ele);
Inorder_Traversal(TN->right);
}
//후위 순회
void Postorder_Traversal(TreeNode *TN)
{
if(TN == NULL)
return;
Postorder_Traversal(TN->left);
Postorder_Traversal(TN->right);
printf("%c",TN->ele);
}
int main(void)
{
int N;
TreeNode *Tree = New_TreeNode(NULL);
TreeNode *Temp_Node;
scanf("%d",&N);
getchar();
for(int i=0; i<N; i++)
{
char parent, left, right;
scanf("%c %c %c",&parent,&left,&right);
getchar();
Temp_Node = Search_TreeNode(Tree, parent);
if(Temp_Node == NULL)
Insert_TreeNode(Tree, parent, left ,right);
else
Insert_TreeNode(Temp_Node, parent, left, right);
}
Preorder_Traversal(Tree); printf("\n");
Inorder_Traversal(Tree); printf("\n");
Postorder_Traversal(Tree); printf("\n");
return 0;
} |
the_stack_data/46488.c | /* f2c.h -- Standard Fortran to C header file */
/** barf [ba:rf] 2. "He suggested using FORTRAN, and everybody barfed."
- From The Shogakukan DICTIONARY OF NEW ENGLISH (Second edition) */
#ifndef F2C_INCLUDE
#define F2C_INCLUDE
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conj(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimag(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* Table of constant values */
static integer c_n1 = -1;
/* > \brief \b ZUNGBR */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download ZUNGBR + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zungbr.
f"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zungbr.
f"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zungbr.
f"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE ZUNGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) */
/* CHARACTER VECT */
/* INTEGER INFO, K, LDA, LWORK, M, N */
/* COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > ZUNGBR generates one of the complex unitary matrices Q or P**H */
/* > determined by ZGEBRD when reducing a complex matrix A to bidiagonal */
/* > form: A = Q * B * P**H. Q and P**H are defined as products of */
/* > elementary reflectors H(i) or G(i) respectively. */
/* > */
/* > If VECT = 'Q', A is assumed to have been an M-by-K matrix, and Q */
/* > is of order M: */
/* > if m >= k, Q = H(1) H(2) . . . H(k) and ZUNGBR returns the first n */
/* > columns of Q, where m >= n >= k; */
/* > if m < k, Q = H(1) H(2) . . . H(m-1) and ZUNGBR returns Q as an */
/* > M-by-M matrix. */
/* > */
/* > If VECT = 'P', A is assumed to have been a K-by-N matrix, and P**H */
/* > is of order N: */
/* > if k < n, P**H = G(k) . . . G(2) G(1) and ZUNGBR returns the first m */
/* > rows of P**H, where n >= m >= k; */
/* > if k >= n, P**H = G(n-1) . . . G(2) G(1) and ZUNGBR returns P**H as */
/* > an N-by-N matrix. */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] VECT */
/* > \verbatim */
/* > VECT is CHARACTER*1 */
/* > Specifies whether the matrix Q or the matrix P**H is */
/* > required, as defined in the transformation applied by ZGEBRD: */
/* > = 'Q': generate Q; */
/* > = 'P': generate P**H. */
/* > \endverbatim */
/* > */
/* > \param[in] M */
/* > \verbatim */
/* > M is INTEGER */
/* > The number of rows of the matrix Q or P**H to be returned. */
/* > M >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The number of columns of the matrix Q or P**H to be returned. */
/* > N >= 0. */
/* > If VECT = 'Q', M >= N >= f2cmin(M,K); */
/* > if VECT = 'P', N >= M >= f2cmin(N,K). */
/* > \endverbatim */
/* > */
/* > \param[in] K */
/* > \verbatim */
/* > K is INTEGER */
/* > If VECT = 'Q', the number of columns in the original M-by-K */
/* > matrix reduced by ZGEBRD. */
/* > If VECT = 'P', the number of rows in the original K-by-N */
/* > matrix reduced by ZGEBRD. */
/* > K >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] A */
/* > \verbatim */
/* > A is COMPLEX*16 array, dimension (LDA,N) */
/* > On entry, the vectors which define the elementary reflectors, */
/* > as returned by ZGEBRD. */
/* > On exit, the M-by-N matrix Q or P**H. */
/* > \endverbatim */
/* > */
/* > \param[in] LDA */
/* > \verbatim */
/* > LDA is INTEGER */
/* > The leading dimension of the array A. LDA >= M. */
/* > \endverbatim */
/* > */
/* > \param[in] TAU */
/* > \verbatim */
/* > TAU is COMPLEX*16 array, dimension */
/* > (f2cmin(M,K)) if VECT = 'Q' */
/* > (f2cmin(N,K)) if VECT = 'P' */
/* > TAU(i) must contain the scalar factor of the elementary */
/* > reflector H(i) or G(i), which determines Q or P**H, as */
/* > returned by ZGEBRD in its array argument TAUQ or TAUP. */
/* > \endverbatim */
/* > */
/* > \param[out] WORK */
/* > \verbatim */
/* > WORK is COMPLEX*16 array, dimension (MAX(1,LWORK)) */
/* > On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* > \endverbatim */
/* > */
/* > \param[in] LWORK */
/* > \verbatim */
/* > LWORK is INTEGER */
/* > The dimension of the array WORK. LWORK >= f2cmax(1,f2cmin(M,N)). */
/* > For optimum performance LWORK >= f2cmin(M,N)*NB, where NB */
/* > is the optimal blocksize. */
/* > */
/* > If LWORK = -1, then a workspace query is assumed; the routine */
/* > only calculates the optimal size of the WORK array, returns */
/* > this value as the first entry of the WORK array, and no error */
/* > message related to LWORK is issued by XERBLA. */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date April 2012 */
/* > \ingroup complex16GBcomputational */
/* ===================================================================== */
/* Subroutine */ int zungbr_(char *vect, integer *m, integer *n, integer *k,
doublecomplex *a, integer *lda, doublecomplex *tau, doublecomplex *
work, integer *lwork, integer *info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2, i__3;
/* Local variables */
integer i__, j;
extern logical lsame_(char *, char *);
integer iinfo;
logical wantq;
integer mn;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
integer lwkopt;
logical lquery;
extern /* Subroutine */ int zunglq_(integer *, integer *, integer *,
doublecomplex *, integer *, doublecomplex *, doublecomplex *,
integer *, integer *), zungqr_(integer *, integer *, integer *,
doublecomplex *, integer *, doublecomplex *, doublecomplex *,
integer *, integer *);
/* -- LAPACK computational routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* April 2012 */
/* ===================================================================== */
/* Test the input arguments */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1 * 1;
a -= a_offset;
--tau;
--work;
/* Function Body */
*info = 0;
wantq = lsame_(vect, "Q");
mn = f2cmin(*m,*n);
lquery = *lwork == -1;
if (! wantq && ! lsame_(vect, "P")) {
*info = -1;
} else if (*m < 0) {
*info = -2;
} else if (*n < 0 || wantq && (*n > *m || *n < f2cmin(*m,*k)) || ! wantq && (
*m > *n || *m < f2cmin(*n,*k))) {
*info = -3;
} else if (*k < 0) {
*info = -4;
} else if (*lda < f2cmax(1,*m)) {
*info = -6;
} else if (*lwork < f2cmax(1,mn) && ! lquery) {
*info = -9;
}
if (*info == 0) {
work[1].r = 1., work[1].i = 0.;
if (wantq) {
if (*m >= *k) {
zungqr_(m, n, k, &a[a_offset], lda, &tau[1], &work[1], &c_n1,
&iinfo);
} else {
if (*m > 1) {
i__1 = *m - 1;
i__2 = *m - 1;
i__3 = *m - 1;
zungqr_(&i__1, &i__2, &i__3, &a[a_offset], lda, &tau[1], &
work[1], &c_n1, &iinfo);
}
}
} else {
if (*k < *n) {
zunglq_(m, n, k, &a[a_offset], lda, &tau[1], &work[1], &c_n1,
&iinfo);
} else {
if (*n > 1) {
i__1 = *n - 1;
i__2 = *n - 1;
i__3 = *n - 1;
zunglq_(&i__1, &i__2, &i__3, &a[a_offset], lda, &tau[1], &
work[1], &c_n1, &iinfo);
}
}
}
lwkopt = (integer) work[1].r;
lwkopt = f2cmax(lwkopt,mn);
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("ZUNGBR", &i__1, (ftnlen)6);
return 0;
} else if (lquery) {
work[1].r = (doublereal) lwkopt, work[1].i = 0.;
return 0;
}
/* Quick return if possible */
if (*m == 0 || *n == 0) {
work[1].r = 1., work[1].i = 0.;
return 0;
}
if (wantq) {
/* Form Q, determined by a call to ZGEBRD to reduce an m-by-k */
/* matrix */
if (*m >= *k) {
/* If m >= k, assume m >= n >= k */
zungqr_(m, n, k, &a[a_offset], lda, &tau[1], &work[1], lwork, &
iinfo);
} else {
/* If m < k, assume m = n */
/* Shift the vectors which define the elementary reflectors one */
/* column to the right, and set the first row and column of Q */
/* to those of the unit matrix */
for (j = *m; j >= 2; --j) {
i__1 = j * a_dim1 + 1;
a[i__1].r = 0., a[i__1].i = 0.;
i__1 = *m;
for (i__ = j + 1; i__ <= i__1; ++i__) {
i__2 = i__ + j * a_dim1;
i__3 = i__ + (j - 1) * a_dim1;
a[i__2].r = a[i__3].r, a[i__2].i = a[i__3].i;
/* L10: */
}
/* L20: */
}
i__1 = a_dim1 + 1;
a[i__1].r = 1., a[i__1].i = 0.;
i__1 = *m;
for (i__ = 2; i__ <= i__1; ++i__) {
i__2 = i__ + a_dim1;
a[i__2].r = 0., a[i__2].i = 0.;
/* L30: */
}
if (*m > 1) {
/* Form Q(2:m,2:m) */
i__1 = *m - 1;
i__2 = *m - 1;
i__3 = *m - 1;
zungqr_(&i__1, &i__2, &i__3, &a[(a_dim1 << 1) + 2], lda, &tau[
1], &work[1], lwork, &iinfo);
}
}
} else {
/* Form P**H, determined by a call to ZGEBRD to reduce a k-by-n */
/* matrix */
if (*k < *n) {
/* If k < n, assume k <= m <= n */
zunglq_(m, n, k, &a[a_offset], lda, &tau[1], &work[1], lwork, &
iinfo);
} else {
/* If k >= n, assume m = n */
/* Shift the vectors which define the elementary reflectors one */
/* row downward, and set the first row and column of P**H to */
/* those of the unit matrix */
i__1 = a_dim1 + 1;
a[i__1].r = 1., a[i__1].i = 0.;
i__1 = *n;
for (i__ = 2; i__ <= i__1; ++i__) {
i__2 = i__ + a_dim1;
a[i__2].r = 0., a[i__2].i = 0.;
/* L40: */
}
i__1 = *n;
for (j = 2; j <= i__1; ++j) {
for (i__ = j - 1; i__ >= 2; --i__) {
i__2 = i__ + j * a_dim1;
i__3 = i__ - 1 + j * a_dim1;
a[i__2].r = a[i__3].r, a[i__2].i = a[i__3].i;
/* L50: */
}
i__2 = j * a_dim1 + 1;
a[i__2].r = 0., a[i__2].i = 0.;
/* L60: */
}
if (*n > 1) {
/* Form P**H(2:n,2:n) */
i__1 = *n - 1;
i__2 = *n - 1;
i__3 = *n - 1;
zunglq_(&i__1, &i__2, &i__3, &a[(a_dim1 << 1) + 2], lda, &tau[
1], &work[1], lwork, &iinfo);
}
}
}
work[1].r = (doublereal) lwkopt, work[1].i = 0.;
return 0;
/* End of ZUNGBR */
} /* zungbr_ */
|
the_stack_data/80500.c | int g=0;
void c() __attribute__((__constructor__)) ;
void c(){
g = 10;
}
int main(){
assert(g==10);
return 0;
} |
the_stack_data/92325891.c | //
// main.c
// 132tcpSocketClient
//
// Created by codew on 12/3/20.
// Copyright © 2020 codertom. All rights reserved.
//
#include <stdio.h>
#include <unistd.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#include <string.h>
int main(int argc, const char * argv[]) {
// insert code here...
printf("Hello, World!\n");
// 1. 创建套接字
int my_socket_fd;
my_socket_fd = socket(AF_INET, SOCK_STREAM, 0);
// 2. 连接服务器
struct sockaddr_in addr;
addr.sin_family = AF_INET;
addr.sin_port = htons(9986);
inet_pton(AF_INET, "155.138.132.36", &addr.sin_addr.s_addr);
// inet_pton(AF_INET, "192.168.31.147", &addr.sin_addr.s_addr);
// connect(<#int#>, <#const struct sockaddr *#>, <#socklen_t#>)
connect(my_socket_fd, (struct sockaddr *)&addr, sizeof(addr) );
// 3. 读写数据
char buf[1024] = "";
while (1)
{
bzero(buf, sizeof(buf));
int n;
// 一直给服务器发消息
n = read(STDIN_FILENO, buf, sizeof(buf));
// 发送数据给服务器
write(my_socket_fd, buf, n);
// 从服务端一直读
n = read(my_socket_fd, buf, sizeof(buf));
write(STDOUT_FILENO, buf, n);
}
// 4. 关闭套接字
close(my_socket_fd);
return 0;
}
|
the_stack_data/81688.c | /* SPDX-License-Identifier: MIT */
int main(int argc, char *argv[])
{
return 0;
}
|
the_stack_data/60046.c | // -----------------------------------------------------------------------------
// Test standard include paths
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK000 %s
// CHECK000: "-cc1" {{.*}} "-internal-externc-isystem" "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/include"
// RUN: %clangxx -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK001 %s
// CHECK001: "-cc1" {{.*}} "-internal-isystem" "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/include/c++"
// CHECK001: "-internal-externc-isystem" "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/include"
// -----------------------------------------------------------------------------
// Test -nostdinc, -nostdlibinc, -nostdinc++
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -nostdinc \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK010 %s
// CHECK010: "-cc1"
// CHECK010-NOT: "-internal-externc-isystem"
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -nostdlibinc \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK011 %s
// CHECK011: "-cc1"
// CHECK011-NOT: "-internal-externc-isystem"
// RUN: %clangxx -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -nostdinc++ \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK012 %s
// CHECK012: "-cc1"
// CHECK012-NOT: "-internal-isystem"
// CHECK012-DAG: "-internal-externc-isystem" "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/include"
// RUN: %clangxx -### -target hexagon-unknown-elf -fno-integrated-as \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/qc/bin \
// RUN: --gcc-toolchain="" \
// RUN: -nostdlibinc \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK013 %s
// CHECK013: "-cc1"
// CHECK013-NOT: "-internal-isystem"
// CHECK013-NOT: "-internal-externc-isystem"
// -----------------------------------------------------------------------------
// Test -mcpu=<cpuname> -mv<number>
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv4 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK020 %s
// CHECK020: "-cc1" {{.*}} "-target-cpu" "hexagonv4"
// CHECK020: hexagon-link{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v4/crt0
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv5 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK021 %s
// CHECK021: "-cc1" {{.*}} "-target-cpu" "hexagonv5"
// CHECK021: hexagon-link{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v5/crt0
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv55 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK022 %s
// CHECK022: "-cc1" {{.*}} "-target-cpu" "hexagonv55"
// CHECK022: hexagon-link{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v55/crt0
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK023 %s
// CHECK023: "-cc1" {{.*}} "-target-cpu" "hexagonv60"
// CHECK023: hexagon-link{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv62 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK024 %s
// CHECK024: "-cc1" {{.*}} "-target-cpu" "hexagonv62"
// CHECK024: hexagon-link{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v62/crt0
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv65 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK025 %s
// CHECK025: "-cc1" {{.*}} "-target-cpu" "hexagonv65"
// CHECK025: hexagon-link{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v65/crt0
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -O3 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK026 %s
// CHECK026-NOT: "-ffp-contract=fast"
// CHECK026: hexagon-link
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -O3 -ffp-contract=off \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK027 %s
// CHECK027-NOT: "-ffp-contract=fast"
// CHECK027: hexagon-link
// -----------------------------------------------------------------------------
// Test Linker related args
// -----------------------------------------------------------------------------
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Defaults for C
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK030 %s
// CHECK030: "-cc1"
// CHECK030-NEXT: hexagon-link
// CHECK030-NOT: "-static"
// CHECK030-NOT: "-shared"
// CHECK030: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0_standalone.o"
// CHECK030: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK030: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK030: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK030: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK030: "{{[^"]+}}.o"
// CHECK030: "--start-group" "-lstandalone" "-lc" "-lgcc" "--end-group"
// CHECK030: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Defaults for C++
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// RUN: %clangxx -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK031 %s
// CHECK031: "-cc1"
// CHECK031-NEXT: hexagon-link
// CHECK031-NOT: "-static"
// CHECK031-NOT: "-shared"
// CHECK031: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0_standalone.o"
// CHECK031: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK031: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK031: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK031: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK031: "{{[^"]+}}.o"
// CHECK031: "-lstdc++" "-lm"
// CHECK031: "--start-group" "-lstandalone" "-lc" "-lgcc" "--end-group"
// CHECK031: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Additional Libraries (-L)
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -Lone -L two -L three \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK032 %s
// CHECK032: "-cc1"
// CHECK032-NEXT: hexagon-link
// CHECK032-NOT: "-static"
// CHECK032-NOT: "-shared"
// CHECK032: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0_standalone.o"
// CHECK032: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK032: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK032: "-Lone" "-Ltwo" "-Lthree"
// CHECK032: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK032: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK032: "{{[^"]+}}.o"
// CHECK032: "--start-group" "-lstandalone" "-lc" "-lgcc" "--end-group"
// CHECK032: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// -static, -shared
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -static \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK033 %s
// CHECK033: "-cc1"
// CHECK033-NEXT: hexagon-link
// CHECK033: "-static"
// CHECK033: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0_standalone.o"
// CHECK033: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK033: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK033: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK033: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK033: "{{[^"]+}}.o"
// CHECK033: "--start-group" "-lstandalone" "-lc" "-lgcc" "--end-group"
// CHECK033: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -shared \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK034 %s
// CHECK034: "-cc1"
// CHECK034-NEXT: hexagon-link
// CHECK034: "-shared" "-call_shared"
// CHECK034-NOT: crt0_standalone.o
// CHECK034-NOT: crt0.o
// CHECK034: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/G0/pic/initS.o"
// CHECK034: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/G0"
// CHECK034: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK034: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK034: "{{[^"]+}}.o"
// CHECK034: "--start-group"
// CHECK034-NOT: "-lstandalone"
// CHECK034-NOT: "-lc"
// CHECK034: "-lgcc"
// CHECK034: "--end-group"
// CHECK034: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/G0/pic/finiS.o"
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -shared \
// RUN: -static \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK035 %s
// CHECK035: "-cc1"
// CHECK035-NEXT: hexagon-link
// CHECK035: "-shared" "-call_shared" "-static"
// CHECK035-NOT: crt0_standalone.o
// CHECK035-NOT: crt0.o
// CHECK035: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/G0/init.o"
// CHECK035: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/G0"
// CHECK035: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK035: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK035: "{{[^"]+}}.o"
// CHECK035: "--start-group"
// CHECK035-NOT: "-lstandalone"
// CHECK035-NOT: "-lc"
// CHECK035: "-lgcc"
// CHECK035: "--end-group"
// CHECK035: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/G0/fini.o"
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// -nostdlib, -nostartfiles, -nodefaultlibs
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// RUN: %clangxx -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -nostdlib \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK036 %s
// CHECK036: "-cc1"
// CHECK036-NEXT: hexagon-link
// CHECK036-NOT: crt0_standalone.o
// CHECK036-NOT: crt0.o
// CHECK036-NOT: init.o
// CHECK036: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK036: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK036: "{{[^"]+}}.o"
// CHECK036-NOT: "-lstdc++"
// CHECK036-NOT: "-lm"
// CHECK036-NOT: "--start-group"
// CHECK036-NOT: "-lstandalone"
// CHECK036-NOT: "-lc"
// CHECK036-NOT: "-lgcc"
// CHECK036-NOT: "--end-group"
// CHECK036-NOT: fini.o
// RUN: %clangxx -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -nostartfiles \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK037 %s
// CHECK037: "-cc1"
// CHECK037-NEXT: hexagon-link
// CHECK037-NOT: crt0_standalone.o
// CHECK037-NOT: crt0.o
// CHECK037-NOT: init.o
// CHECK037: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK037: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK037: "{{[^"]+}}.o"
// CHECK037: "-lstdc++"
// CHECK037: "-lm"
// CHECK037: "--start-group"
// CHECK037: "-lstandalone"
// CHECK037: "-lc"
// CHECK037: "-lgcc"
// CHECK037: "--end-group"
// CHECK037-NOT: fini.o
// RUN: %clangxx -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -nodefaultlibs \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK038 %s
// CHECK038: "-cc1"
// CHECK038-NEXT: hexagon-link
// CHECK038: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0_standalone.o"
// CHECK038: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK038: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK038: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK038: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK038: "{{[^"]+}}.o"
// CHECK038-NOT: "-lstdc++"
// CHECK038-NOT: "-lm"
// CHECK038-NOT: "--start-group"
// CHECK038-NOT: "-lstandalone"
// CHECK038-NOT: "-lc"
// CHECK038-NOT: "-lgcc"
// CHECK038-NOT: "--end-group"
// CHECK038: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// -moslib
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -moslib=first -moslib=second \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK039 %s
// CHECK039: "-cc1"
// CHECK039-NEXT: hexagon-link
// CHECK039-NOT: "-static"
// CHECK039-NOT: "-shared"
// CHECK039-NOT: crt0_standalone.o
// CHECK039: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK039: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK039: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK039: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK039: "{{[^"]+}}.o"
// CHECK039: "--start-group"
// CHECK039: "-lfirst" "-lsecond"
// CHECK039-NOT: "-lstandalone"
// CHECK039: "-lc" "-lgcc" "--end-group"
// CHECK039: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -moslib=first -moslib=second -moslib=standalone \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK03A %s
// CHECK03A: "-cc1"
// CHECK03A-NEXT: hexagon-link
// CHECK03A-NOT: "-static"
// CHECK03A-NOT: "-shared"
// CHECK03A: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0_standalone.o"
// CHECK03A: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK03A: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK03A: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK03A: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK03A: "{{[^"]+}}.o"
// CHECK03A: "--start-group"
// CHECK03A: "-lfirst" "-lsecond"
// CHECK03A: "-lstandalone"
// CHECK03A: "-lc" "-lgcc" "--end-group"
// CHECK03A: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Other args to pass to linker
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// RUN: %clangxx -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -s \
// RUN: -Tbss 0xdead -Tdata 0xbeef -Ttext 0xcafe \
// RUN: -t \
// RUN: -e start_here \
// RUN: -uFoo -undefined Bar \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK03B %s
// CHECK03B: "-cc1"
// CHECK03B-NEXT: hexagon-link
// CHECK03B: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0_standalone.o"
// CHECK03B: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/crt0.o"
// CHECK03B: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/init.o"
// CHECK03B: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60"
// CHECK03B: "-L{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib"
// CHECK03B: "-s"
// CHECK03B: "-Tbss" "0xdead" "-Tdata" "0xbeef" "-Ttext" "0xcafe"
// CHECK03B: "-t"
// CHECK03B: "-u" "Foo" "-undefined" "Bar"
// CHECK03B: "{{[^"]+}}.o"
// CHECK03B: "-lstdc++" "-lm"
// CHECK03B: "--start-group" "-lstandalone" "-lc" "-lgcc" "--end-group"
// CHECK03B: "{{.*}}/Inputs/hexagon_tree/Tools/bin/../target/hexagon/lib/v60/fini.o"
// -----------------------------------------------------------------------------
// pic, small data threshold
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK040 %s
// CHECK040: "-cc1"
// CHECK040-NEXT: hexagon-link
// CHECK040-NOT: "-G{{[0-9]+}}"
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -fpic \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK041 %s
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -fPIC \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK041 %s
// CHECK041: "-cc1"
// CHECK041-NOT: "-mrelocation-model" "static"
// CHECK041: "-pic-level" "{{[12]}}"
// CHECK041: "-mllvm" "-hexagon-small-data-threshold=0"
// CHECK041-NEXT: hexagon-link
// CHECK041: "-G0"
// RUN: %clang -### -target hexagon-unknown-elf -fno-integrated-as \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -G=8 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK042 %s
// RUN: %clang -### -target hexagon-unknown-elf -fno-integrated-as \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -G 8 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK042 %s
// RUN: %clang -### -target hexagon-unknown-elf -fno-integrated-as \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -msmall-data-threshold=8 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK042 %s
// CHECK042: "-cc1"
// CHECK042: "-mrelocation-model" "static"
// CHECK042: "-mllvm" "-hexagon-small-data-threshold=8"
// CHECK042-NEXT: llvm-mc
// CHECK042: "-gpsize=8"
// CHECK042-NEXT: hexagon-link
// CHECK042: "-G8"
// -----------------------------------------------------------------------------
// pie
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -pie \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK050 %s
// CHECK050: "-cc1"
// CHECK050-NEXT: hexagon-link
// CHECK050: "-pie"
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -pie -shared \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK051 %s
// CHECK051: "-cc1"
// CHECK051-NEXT: hexagon-link
// CHECK051-NOT: "-pie"
// -----------------------------------------------------------------------------
// Test Assembler related args
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf -fno-integrated-as \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: -gdwarf-2 \
// RUN: -Wa,--noexecstack,--trap \
// RUN: -Xassembler --keep-locals \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK060 %s
// CHECK060: "-cc1"
// CHECK060-NEXT: llvm-mc
// CHECK060: "--noexecstack" "--trap" "--keep-locals"
// CHECK060-NEXT: hexagon-link
// -----------------------------------------------------------------------------
// ffixed-r19
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf -ffixed-r19 %s 2>&1 \
// RUN: | FileCheck --check-prefix=CHECK070 %s
// CHECK070: "-target-feature" "+reserved-r19"
// RUN: %clang -### -target hexagon-unknown-elf %s 2>&1 \
// RUN: | FileCheck --check-prefix=CHECK071 %s
// CHECK071-NOT: "+reserved-r19"
// -----------------------------------------------------------------------------
// Misc Defaults
// -----------------------------------------------------------------------------
// RUN: %clang -### -target hexagon-unknown-elf \
// RUN: -ccc-install-dir %S/Inputs/hexagon_tree/Tools/bin \
// RUN: -mcpu=hexagonv60 \
// RUN: %s 2>&1 \
// RUN: | FileCheck -check-prefix=CHECK080 %s
// CHECK080: "-cc1"
// CHECK080: "-Wreturn-type"
|
the_stack_data/187642227.c | #define _CRT_SECURE_NO_WARNINGS
#include <stdlib.h>
#include <stdio.h>
#define ARRAY_SIZE 50
int main()
{
FILE* file = fopen("input.txt", "r");
if (file == NULL)
{
return -1;
}
int n = 0;
fscanf_s(file, "%d", &n);
int matrix[ARRAY_SIZE][ARRAY_SIZE] = { 0 };
int inputNumber = 0;
int i = 0;
int j = 0;
while (!feof(file))
{
fscanf_s(file, "%d", &inputNumber);
matrix[i][j] = inputNumber;
if (j % n == n - 1)
{
j = 0;
++i;
}
else
{
++j;
}
}
fclose(file);
for (int k = 1; k < n; ++k)
{
for (int i = 1; i < n; ++i)
{
for (int j = 1; j < n; ++j)
{
matrix[i][j] = matrix[i][j] || (matrix[i][k] && matrix[k][j]);
}
}
}
FILE* outfile = fopen("output.txt", "w");
if (file == NULL)
{
return -1;
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
fprintf(outfile, "%d ", matrix[i][j]);
}
fprintf(outfile, "\n");
}
fclose(outfile);
return 0;
}
|
the_stack_data/47700.c | /*
* regmath - Register maths - add, subtract, multiply
*
* Written in 2013 by Prashant P Shah <[email protected]>
*
* To the extent possible under law, the author(s) have dedicated
* all copyright and related and neighboring rights to this software
* to the public domain worldwide. This software is distributed
* without any warranty.
*
* You should have received a copy of the CC0 Public Domain Dedication
* along with this software.
* If not, see <http://creativecommons.org/publicdomain/zero/1.0/>.
*/
// Note : Use GDB to inspect value of registers
// gcc -g -Wall regmath.c -o regmath
// gdb regmath
// break <line-number>
// run
// info registers
// print $rax
#include <stdio.h>
int main(int argc, char *argv[])
{
/* Copying */
asm("MOVL $5, %eax");
asm("MOVL %eax, %ebx");
/* Addition - save result in %eax */
asm("MOVL $10, %eax");
asm("MOVL $20, %ebx");
asm("ADDL %ebx, %eax");
/* Subtract - save result in %eax */
asm("MOVL $200, %eax");
asm("MOVL $25, %ebx");
asm("SUBL %ebx, %eax");
/* Multiply - save result in %eax */
asm("MOVL $20, %eax");
asm("MOVL $30, %ebx");
asm("IMULL %ebx, %eax");
return 0;
}
|
the_stack_data/82853.c | /*
A naive implementation of the euclidean algorithm. The euclidean algorithm
finds the greates common divisor of a pair of natural numbers (GCD).
Author: Alek Frohlich, Date: 07/07/2019.
*/
#include <stdio.h>
#ifdef __COUNT_OPS__
int ops = 0;
#endif
int gcd(int u, int v) {
#ifdef __COUNT_OPS__
ops = 1; // accounting for the failed while condition check
#endif
int t;
while (u > 0) {
if (u < v) {
t = u;
u = v;
v = t;
#ifdef __COUNT_OPS__
ops += 3;
#endif
}
u = u-v;
#ifdef __COUNT_OPS__
ops += 3;
#endif
}
return v;
}
int main() {
int x,y;
while (scanf("%d %d", &x, &y) != EOF) {
if (x > 0 && y > 0) {
printf("%d %d %d\n", x, y, gcd(x,y));
#ifdef __COUNT_OPS__
printf("The program ran %d operations!\n", ops);
#endif
}
}
}
|
the_stack_data/51700114.c | int mx_isspace(int sym) {
if (sym == ' ' || sym == '\t' || sym == '\n' || sym == '\v' ||
sym == '\f' || sym == '\r')
return 1;
return 0;
}
|
the_stack_data/64199055.c | /*
* arch/arm/mach-tegra/tegra12_edp.c
*
* Copyright (c) 2013-2014, NVIDIA CORPORATION. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms and conditions of the GNU General Public License,
* version 2, as published by the Free Software Foundation.
*
* This program is distributed in the hope it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifdef CONFIG_ARCH_TEGRA_12x_SOC
#include <linux/tegra-fuse.h>
#include <mach/edp.h>
#if defined(CONFIG_SYSEDP_FRAMEWORK) && !defined(CONFIG_ARCH_TEGRA_13x_SOC)
static struct tegra_sysedp_corecap td580d_sysedp_corecap[] = {
/*
TD580D/CD580M/SD580N
GPU MaxF 853000 KHz
CPU MaxBudget 12000 mW
*/
/*mW CPU intensive load GPU intensive load */
/*mW budget gpu(khz) mem(khz) budget gpu(khz) mem(khz) pthrot(mW)*/
{5000, {1500, 108000, 933000 }, {1500, 108000, 933000 }, 1116 },
{6000, {3000, 108000, 933000 }, {3000, 108000, 933000 }, 2109 },
{7000, {4000, 108000, 933000 }, {3000, 180000, 933000 }, 2589 },
{8000, {5000, 108000, 933000 }, {3000, 252000, 933000 }, 3068 },
{9000, {6000, 180000, 933000 }, {2500, 396000, 933000 }, 3630 },
{10000, {7000, 108000, 933000 }, {3500, 396000, 933000 }, 4425 },
{11000, {7000, 252000, 933000 }, {4000, 468000, 933000 }, 5301 },
{12000, {8000, 180000, 933000 }, {3000, 540000, 933000 }, 5348 },
{13000, {9000, 108000, 933000 }, {5000, 540000, 933000 }, 6969 },
{14000, {10000, 108000, 933000 }, {3500, 612000, 933000 }, 6846 },
{15000, {10000, 180000, 933000 }, {4000, 648000, 933000 }, 7880 },
{16000, {11000, 180000, 933000 }, {3500, 684000, 933000 }, 8120 },
{17000, {12000, 108000, 933000 }, {4000, 708000, 933000 }, 9024 },
{18000, {12000, 252000, 933000 }, {3000, 756000, 933000 }, 9252 },
{19000, {12000, 252000, 933000 }, {4000, 756000, 933000 }, 10046 },
{20000, {12000, 396000, 933000 }, {5000, 756000, 933000 }, 10873 },
{21000, {12000, 468000, 933000 }, {3500, 804000, 933000 }, 10909 },
{22000, {12000, 540000, 933000 }, {4000, 804000, 933000 }, 11306 },
{23000, {12000, 540000, 933000 }, {4000, 853000, 933000 }, 12696 },
{24000, {12000, 612000, 933000 }, {5000, 853000, 933000 }, 13524 },
{25000, {12000, 612000, 933000 }, {5000, 853000, 933000 }, 13524 },
{26000, {12000, 684000, 933000 }, {6000, 853000, 933000 }, 14452 },
{27000, {12000, 708000, 933000 }, {7000, 853000, 933000 }, 15002 },
{28000, {12000, 708000, 933000 }, {8000, 853000, 933000 }, 16030 },
{29000, {12000, 756000, 933000 }, {8000, 853000, 933000 }, 16311 },
{30000, {12000, 756000, 933000 }, {8000, 853000, 933000 }, 16311 },
{31000, {12000, 756000, 933000 }, {8000, 853000, 933000 }, 16311 },
{32000, {12000, 804000, 933000 }, {9000, 853000, 933000 }, 16883 },
{33000, {12000, 804000, 933000 }, {10000, 853000, 933000 }, 17721 },
};
static struct tegra_sysedp_corecap td570d_sysedp_corecap[] = {
/*
TD570D/SD570N
GPU MaxF 648000 KHz
CPU MaxBudget 9000 mW
*/
/*mW CPU intensive load GPU intensive load */
/*mW budget gpu(khz) mem(khz) budget gpu(khz) mem(khz) pthrot(mW)*/
{5000, {1500, 108000, 792000 }, {1500, 108000, 792000 }, 918 },
{6000, {3000, 108000, 792000 }, {3000, 108000, 792000 }, 2109 },
{7000, {4000, 108000, 792000 }, {3000, 180000, 792000 }, 2589 },
{8000, {5000, 108000, 792000 }, {3000, 252000, 792000 }, 3068 },
{9000, {6000, 180000, 792000 }, {2500, 396000, 792000 }, 3630 },
{10000, {7000, 108000, 792000 }, {3500, 396000, 792000 }, 4425 },
{11000, {7000, 252000, 792000 }, {4000, 468000, 792000 }, 5301 },
{12000, {8000, 180000, 792000 }, {3000, 540000, 792000 }, 5348 },
{13000, {9000, 108000, 792000 }, {5000, 540000, 792000 }, 6969 },
{14000, {9000, 180000, 792000 }, {3500, 612000, 792000 }, 6846 },
{15000, {9000, 252000, 792000 }, {4000, 648000, 792000 }, 7880 },
{16000, {9000, 396000, 792000 }, {5000, 648000, 792000 }, 8770 },
{17000, {9000, 468000, 792000 }, {6000, 648000, 792000 }, 9488 },
{18000, {9000, 468000, 792000 }, {7000, 648000, 792000 }, 9488 },
{19000, {9000, 540000, 792000 }, {7000, 648000, 792000 }, 10185 },
{20000, {9000, 612000, 792000 }, {7000, 648000, 792000 }, 10185 },
{21000, {9000, 612000, 792000 }, {8000, 648000, 792000 }, 10804 },
{22000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{23000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{24000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{25000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{26000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{27000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{28000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{29000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{30000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{31000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{32000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
{33000, {9000, 648000, 792000 }, {9000, 648000, 792000 }, 12066 },
};
static struct tegra_sysedp_corecap td575d_sysedp_corecap[] = {
/*
TD575D/CD575M/SD575N
GPU MaxF 853000 KHz
CPU MaxBudget 10000 mW
*/
/*mW CPU intensive load GPU intensive load */
/*mW budget gpu(khz) mem(khz) budget gpu(khz) mem(khz) pthrot(mW) */
{5000, {1500, 108000, 933000}, {1500, 108000, 933000 }, 918 },
{6000, {3000, 108000, 933000}, {3000, 108000, 933000 }, 2109 },
{7000, {4000, 108000, 933000}, {3000, 180000, 933000 }, 2589 },
{8000, {5000, 108000, 933000}, {3000, 252000, 933000 }, 3068 },
{9000, {6000, 180000, 933000}, {2500, 396000, 933000 }, 3630 },
{10000, {7000, 108000, 933000}, {3500, 396000, 933000 }, 4425 },
{11000, {7000, 252000, 933000}, {4000, 468000, 933000 }, 5301 },
{12000, {8000, 180000, 933000}, {3000, 540000, 933000 }, 5348 },
{13000, {9000, 108000, 933000}, {5000, 540000, 933000 }, 6969 },
{14000, {10000, 108000, 933000}, {3500, 612000, 933000 }, 6846 },
{15000, {10000, 180000, 933000}, {4000, 648000, 933000 }, 7880 },
{16000, {10000, 252000, 933000}, {3500, 684000, 933000 }, 8120 },
{17000, {10000, 396000, 933000}, {4000, 708000, 933000 }, 9024 },
{18000, {10000, 396000, 933000}, {3000, 756000, 933000 }, 9252 },
{19000, {10000, 468000, 933000}, {4000, 756000, 933000 }, 10046 },
{20000, {10000, 540000, 933000}, {5000, 756000, 933000 }, 10873 },
{21000, {10000, 540000, 933000}, {3500, 804000, 933000 }, 10909 },
{22000, {10000, 612000, 933000}, {4000, 804000, 933000 }, 11306 },
{23000, {10000, 648000, 933000}, {4000, 853000, 933000 }, 12696 },
{24000, {10000, 708000, 933000}, {5000, 853000, 933000 }, 13524 },
{25000, {10000, 708000, 933000}, {5000, 853000, 933000 }, 13524 },
{26000, {10000, 708000, 933000}, {6000, 853000, 933000 }, 14049 },
{27000, {10000, 756000, 933000}, {7000, 853000, 933000 }, 15002 },
{28000, {10000, 756000, 933000}, {8000, 853000, 933000 }, 15071 },
{29000, {10000, 804000, 933000}, {8000, 853000, 933000 }, 15621 },
{30000, {10000, 804000, 933000}, {8000, 853000, 933000 }, 15621 },
{31000, {10000, 804000, 933000}, {8000, 853000, 933000 }, 15621 },
{32000, {10000, 804000, 933000}, {9000, 853000, 933000 }, 16331 },
{33000, {10000, 853000, 933000}, {10000, 853000, 933000 }, 17721 },
};
static struct tegra_sysedp_corecap cd570m_sysedp_corecap[] = {
/*
CD570M
GPU MaxF 648000 KHz
CPU MaxBudget 10000 mW
*/
/*mW CPU intensive load GPU intensive load */
/*mW budget gpu(khz) mem(khz) budget gpu(khz) mem(khz) pthrot(mW)*/
{5000, {1500, 108000, 933000}, {1500, 108000, 933000}, 918 },
{6000, {3000, 108000, 933000}, {3000, 108000, 933000}, 2109 },
{7000, {4000, 108000, 933000}, {3000, 180000, 933000}, 2589 },
{8000, {5000, 108000, 933000}, {3000, 252000, 933000}, 3068 },
{9000, {6000, 180000, 933000}, {2500, 396000, 933000}, 3630 },
{10000, {7000, 108000, 933000}, {3500, 396000, 933000}, 4425 },
{11000, {7000, 252000, 933000}, {4000, 468000, 933000}, 5301 },
{12000, {8000, 180000, 933000}, {3000, 540000, 933000}, 5348 },
{13000, {9000, 108000, 933000}, {5000, 540000, 933000}, 6969 },
{14000, {10000, 108000, 933000}, {3500, 612000, 933000}, 6846 },
{15000, {10000, 180000, 933000}, {4000, 648000, 933000}, 7880 },
{16000, {10000, 252000, 933000}, {5000, 648000, 933000}, 8707 },
{17000, {10000, 396000, 933000}, {6000, 648000, 933000}, 9636 },
{18000, {10000, 396000, 933000}, {7000, 648000, 933000}, 9846 },
{19000, {10000, 468000, 933000}, {7000, 648000, 933000}, 10185 },
{20000, {10000, 540000, 933000}, {7000, 648000, 933000}, 10185 },
{21000, {10000, 540000, 933000}, {8000, 648000, 933000}, 10804 },
{22000, {10000, 612000, 933000}, {9000, 648000, 933000}, 12904 },
{23000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{24000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{25000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{26000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{27000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{28000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{29000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{30000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{31000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{32000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
{33000, {10000, 648000, 933000}, {10000, 648000, 933000}, 12904 },
};
struct tegra_sysedp_corecap *tegra_get_sysedp_corecap(unsigned int *sz)
{
int cpu_speedo_id;
int gpu_speedo_id;
BUG_ON(sz == NULL);
cpu_speedo_id = tegra_cpu_speedo_id();
gpu_speedo_id = tegra_gpu_speedo_id();
switch (cpu_speedo_id) {
case 0x5:
case 0x2:
if (gpu_speedo_id == 1) {
/* 575 variants */
*sz = ARRAY_SIZE(td575d_sysedp_corecap);
return td575d_sysedp_corecap;
} else {
/* CD570M */
*sz = ARRAY_SIZE(cd570m_sysedp_corecap);
return cd570m_sysedp_corecap;
}
case 0x3:
case 0x1:
/* 580 variants */
*sz = ARRAY_SIZE(td580d_sysedp_corecap);
return td580d_sysedp_corecap;
default:
pr_warn("%s: Unknown cpu_speedo_id, 0x%x. "
" Assuming td570d sysedp_corecap table.\n",
__func__, cpu_speedo_id);
/* intentional fall-through */
case 0x0:
/* 570 variants */
*sz = ARRAY_SIZE(td570d_sysedp_corecap);
return td570d_sysedp_corecap;
}
}
#endif
#ifdef CONFIG_TEGRA_EDP_LIMITS
#ifdef CONFIG_TEGRA_GPU_EDP
static struct tegra_edp_gpu_powermodel_params t12x_gpu_powermodel_params = {
.common = {
.temp_scaled = 10,
.dyn_scaled = 1000,
.dyn_consts_n = { 10646, },
.consts_scaled = 1,
.leakage_consts_n = { 1, },
.ijk_scaled = 100000,
.leakage_min = 30,
.leakage_consts_ijk = {
/* i = 0 */
{ { -208796792, 37746202, -9648869, 725660, },
{ 704446675, -133808535, 34470023, -2464142, },
{ -783701649, 146557393, -38623024, 2654269, },
{ 292709580, -51246839, 13984499, -934964, },
},
/* i = 1 */
{ { 115095343, -65602614, 11251896, -838394, },
{ -394753929, 263095142, -49006854, 3326269, },
{ 441644020, -313320338, 61612126, -3916786, },
{ -164021554, 118634317, -24406245, 1517573, },
},
/* i = 2 */
{ { -38857760, 12243796, -1964159, 181232, },
{ 143265078, -71110695, 13985680, -917947, },
{ -171456530, 98906114, -21261015, 1216159, },
{ 67437536, -40520060, 9265259, -484818, },
},
/* i = 3 */
{ { 1795940, -345535, 83004, -20007, },
{ -8549105, 6333235, -1479815, 115441, },
{ 12192546, -10880741, 2632212, -161404, },
{ -5328587, 4953756, -1215038, 64556, },
},
},
},
};
struct tegra_edp_gpu_powermodel_params *tegra12x_get_gpu_powermodel_params(void)
{
return &t12x_gpu_powermodel_params;
}
#endif /* CONFIG_TEGRA_GPU_EDP */
#if !defined(CONFIG_ARCH_TEGRA_13x_SOC)
#define LEAKAGE_CONSTS_IJK_COMMON \
{ \
/* i = 0 */ \
{ { -309609464, 197786326, -40763150, 1613941, }, \
{ 964716269, -569081375, 115781607, -4206296, }, \
{ -994324790, 529664031, -106360108, 3454033, }, \
{ 343209442, -160577505, 31928605, -895157, }, \
}, \
/* i = 1 */ \
{ { 616319664, -637007187, 137759592, -7194133, }, \
{ -1853817283, 1896032851, -407407611, 20868220, }, \
{ 1824097131, -1831611624, 390753403, -19530122, }, \
{ -589155245, 578838526, -122655676, 5985577, }, \
}, \
/* i = 2 */ \
{ { -439994037, 455845250, -104097013, 6191899, }, \
{ 1354650774, -1395561938, 318665647, -18886906, }, \
{ -1361677255, 1390149678, -317474532, 18728266, }, \
{ 447877887, -451382027, 103201434, -6046692, }, \
}, \
/* i = 3 */ \
{ { 56797556, -59779544, 13810295, -848290, }, \
{ -175867301, 184753957, -42708242, 2621537, }, \
{ 177626357, -185996541, 43029384, -2638283, }, \
{ -58587547, 61075322, -14145853, 865351, }, \
}, \
}
#define EDP_PARAMS_COMMON_PART \
{ \
.temp_scaled = 10, \
.dyn_scaled = 1000, \
.dyn_consts_n = { 950, 1399, 2166, 3041 }, \
.consts_scaled = 100, \
.leakage_consts_n = { 45, 67, 87, 100 }, \
.ijk_scaled = 100000, \
.leakage_min = 30, \
/* .volt_temp_cap = { 70, 1240 }, - TODO for T124 */ \
.leakage_consts_ijk = LEAKAGE_CONSTS_IJK_COMMON \
}
static struct tegra_edp_cpu_powermodel_params t12x_cpu_powermodel_params[] = {
{
.cpu_speedo_id = 0, /* Engg SKU */
.common = EDP_PARAMS_COMMON_PART,
},
{
.cpu_speedo_id = 1, /* Prod SKU */
.common = EDP_PARAMS_COMMON_PART,
},
{
.cpu_speedo_id = 2, /* Prod SKU */
.common = EDP_PARAMS_COMMON_PART,
},
{
.cpu_speedo_id = 3, /* Prod SKU */
.common = EDP_PARAMS_COMMON_PART,
},
{
.cpu_speedo_id = 5, /* Prod SKU */
.common = EDP_PARAMS_COMMON_PART,
},
};
struct tegra_edp_cpu_powermodel_params *tegra12x_get_cpu_powermodel_params(
int index,
unsigned int *sz)
{
BUG_ON(index >= ARRAY_SIZE(t12x_cpu_powermodel_params));
if (sz)
*sz = ARRAY_SIZE(t12x_cpu_powermodel_params);
return &t12x_cpu_powermodel_params[index];
}
#endif /* CONFIG_ARCH_TEGRA_12x_SOC && !CONFIG_ARCH_TEGRA_13x_SOC */
#endif /* CONFIG_TEGRA_EDP_LIMITS */
#endif /* CONFIG_ARCH_TEGRA_12x_SOC */
|
the_stack_data/73574480.c | int roll_dice(int num, int sides) {
int x,cnt;
cnt = 0;
for(x=0;x<num;x++) {
cnt += random(sides)+1;
}
return cnt;
} |
the_stack_data/1234098.c | // where_are_the_bits.c ... determine bit-field order
// COMP1521 Lab 03 Exercise
// Written by ...
#include <stdio.h>
#include <stdlib.h>
struct _bit_fields {
unsigned int a : 4,
b : 8,
c : 20;
};
union float_field {
struct _bit_fields bits;
unsigned int this;
};
int main(void)
{
struct _bit_fields x;
unsigned int *i = (unsigned int *) &x;
x.a =
printf("%ul\n",sizeof(x));
union float_field y;
y.bits.c =2;
y.bits.a =0;
y.bits.b =0;
printf("%u\n",y.this);
y.bits.c =0;
y.bits.a =2;
y.bits.b =0;
printf("%u\n",y.this);
return 0;
}
|
the_stack_data/122016851.c | extern void __VERIFIER_error() __attribute__ ((__noreturn__));
extern int __VERIFIER_nondet_int(void);
extern int printf (__const char *__restrict __format, ...);
/* Generated by CIL v. 1.3.7 */
/* print_CIL_Input is true */
struct JoinPoint {
void **(*fp)(struct JoinPoint * ) ;
void **args ;
int argsCount ;
char const **argsType ;
void *(*arg)(int , struct JoinPoint * ) ;
char const *(*argType)(int , struct JoinPoint * ) ;
void **retValue ;
char const *retType ;
char const *funcName ;
char const *targetName ;
char const *fileName ;
char const *kind ;
void *excep_return ;
};
struct __UTAC__CFLOW_FUNC {
int (*func)(int , int ) ;
int val ;
struct __UTAC__CFLOW_FUNC *next ;
};
struct __UTAC__EXCEPTION {
void *jumpbuf ;
unsigned long long prtValue ;
int pops ;
struct __UTAC__CFLOW_FUNC *cflowfuncs ;
};
typedef unsigned int size_t;
struct __ACC__ERR {
void *v ;
struct __ACC__ERR *next ;
};
#pragma merger(0,"wsllib_check.i","")
void __automaton_fail(void)
{
{
ERROR: __VERIFIER_error();
return;
}
}
#pragma merger(0,"featureselect.i","")
int select_one(void) ;
void select_features(void) ;
void select_helpers(void) ;
int valid_product(void) ;
int select_one(void)
{ int retValue_acc ;
int choice = __VERIFIER_nondet_int();
{
retValue_acc = choice;
return (retValue_acc);
return (retValue_acc);
}
}
void select_features(void)
{
{
return;
}
}
void select_helpers(void)
{
{
return;
}
}
int valid_product(void)
{ int retValue_acc ;
{
retValue_acc = 1;
return (retValue_acc);
return (retValue_acc);
}
}
#pragma merger(0,"MinePump.i","")
void lowerWaterLevel(void) ;
int isMethaneLevelCritical(void) ;
void printEnvironment(void) ;
void timeShift(void) ;
void activatePump(void) ;
void deactivatePump(void) ;
int isPumpRunning(void) ;
void printPump(void) ;
void startSystem(void) ;
int pumpRunning = 0;
int systemActive = 1;
void __utac_acc__Specification4_spec__1(void) ;
void processEnvironment(void) ;
void timeShift(void)
{
{
if (pumpRunning) {
{
lowerWaterLevel();
}
} else {
}
if (systemActive) {
{
processEnvironment();
}
} else {
}
{
__utac_acc__Specification4_spec__1();
}
return;
}
}
void processEnvironment(void)
{
{
return;
}
}
void activatePump(void)
{
{
pumpRunning = 1;
return;
}
}
void deactivatePump(void)
{
{
pumpRunning = 0;
return;
}
}
int isMethaneAlarm(void)
{ int retValue_acc ;
{
{
retValue_acc = isMethaneLevelCritical();
}
return (retValue_acc);
return (retValue_acc);
}
}
int isPumpRunning(void)
{ int retValue_acc ;
{
retValue_acc = pumpRunning;
return (retValue_acc);
return (retValue_acc);
}
}
void printPump(void)
{
{
{
printf("Pump(System:");
}
if (systemActive) {
{
printf("On");
}
} else {
{
printf("Off");
}
}
{
printf(",Pump:");
}
if (pumpRunning) {
{
printf("On");
}
} else {
{
printf("Off");
}
}
{
printf(") ");
printEnvironment();
printf("\n");
}
return;
}
}
void startSystem(void)
{
{
systemActive = 1;
return;
}
}
#pragma merger(0,"scenario.i","")
void waterRise(void) ;
void changeMethaneLevel(void) ;
void cleanup(void) ;
void test(void)
{ int splverifierCounter ;
int tmp ;
int tmp___0 ;
int tmp___1 ;
int tmp___2 ;
{
splverifierCounter = 0;
{
while (1) {
while_0_continue: /* CIL Label */ ;
if (splverifierCounter < 4) {
} else {
goto while_0_break;
}
{
tmp = __VERIFIER_nondet_int();
}
if (tmp) {
{
waterRise();
}
} else {
}
{
tmp___0 = __VERIFIER_nondet_int();
}
if (tmp___0) {
{
changeMethaneLevel();
}
} else {
}
{
tmp___2 = __VERIFIER_nondet_int();
}
if (tmp___2) {
{
startSystem();
}
} else {
{
tmp___1 = __VERIFIER_nondet_int();
}
if (tmp___1) {
} else {
}
}
{
timeShift();
}
}
while_0_break: /* CIL Label */ ;
}
{
cleanup();
}
return;
}
}
#pragma merger(0,"Environment.i","")
int getWaterLevel(void) ;
int waterLevel = 1;
int methaneLevelCritical = 0;
void lowerWaterLevel(void)
{
{
if (waterLevel > 0) {
waterLevel = waterLevel - 1;
} else {
}
return;
}
}
void waterRise(void)
{
{
if (waterLevel < 2) {
waterLevel = waterLevel + 1;
} else {
}
return;
}
}
void changeMethaneLevel(void)
{
{
if (methaneLevelCritical) {
methaneLevelCritical = 0;
} else {
methaneLevelCritical = 1;
}
return;
}
}
int isMethaneLevelCritical(void)
{ int retValue_acc ;
{
retValue_acc = methaneLevelCritical;
return (retValue_acc);
return (retValue_acc);
}
}
void printEnvironment(void)
{
{
{
printf("Env(Water:%i", waterLevel);
printf(",Meth:");
}
if (methaneLevelCritical) {
{
printf("CRIT");
}
} else {
{
printf("OK");
}
}
{
printf(")");
}
return;
}
}
int getWaterLevel(void)
{ int retValue_acc ;
{
retValue_acc = waterLevel;
return (retValue_acc);
return (retValue_acc);
}
}
#pragma merger(0,"Specification4_spec.i","")
void __utac_acc__Specification4_spec__1(void)
{ int tmp ;
int tmp___0 ;
{
{
tmp = getWaterLevel();
}
if (tmp == 0) {
{
tmp___0 = isPumpRunning();
}
if (tmp___0) {
{
__automaton_fail();
}
} else {
}
} else {
}
return;
}
}
#pragma merger(0,"libacc.i","")
extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion ,
char const *__file ,
unsigned int __line ,
char const *__function ) ;
extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ;
extern __attribute__((__nothrow__)) void free(void *__ptr ) ;
void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int ,
int ) ,
int val )
{ struct __UTAC__EXCEPTION *excep ;
struct __UTAC__CFLOW_FUNC *cf ;
void *tmp ;
unsigned long __cil_tmp7 ;
unsigned long __cil_tmp8 ;
unsigned long __cil_tmp9 ;
unsigned long __cil_tmp10 ;
unsigned long __cil_tmp11 ;
unsigned long __cil_tmp12 ;
unsigned long __cil_tmp13 ;
unsigned long __cil_tmp14 ;
int (**mem_15)(int , int ) ;
int *mem_16 ;
struct __UTAC__CFLOW_FUNC **mem_17 ;
struct __UTAC__CFLOW_FUNC **mem_18 ;
struct __UTAC__CFLOW_FUNC **mem_19 ;
{
{
excep = (struct __UTAC__EXCEPTION *)exception;
tmp = malloc(24UL);
cf = (struct __UTAC__CFLOW_FUNC *)tmp;
mem_15 = (int (**)(int , int ))cf;
*mem_15 = cflow_func;
__cil_tmp7 = (unsigned long )cf;
__cil_tmp8 = __cil_tmp7 + 8;
mem_16 = (int *)__cil_tmp8;
*mem_16 = val;
__cil_tmp9 = (unsigned long )cf;
__cil_tmp10 = __cil_tmp9 + 16;
__cil_tmp11 = (unsigned long )excep;
__cil_tmp12 = __cil_tmp11 + 24;
mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10;
mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12;
*mem_17 = *mem_18;
__cil_tmp13 = (unsigned long )excep;
__cil_tmp14 = __cil_tmp13 + 24;
mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;
*mem_19 = cf;
}
return;
}
}
void __utac__exception__cf_handler_free(void *exception )
{ struct __UTAC__EXCEPTION *excep ;
struct __UTAC__CFLOW_FUNC *cf ;
struct __UTAC__CFLOW_FUNC *tmp ;
unsigned long __cil_tmp5 ;
unsigned long __cil_tmp6 ;
struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;
unsigned long __cil_tmp8 ;
unsigned long __cil_tmp9 ;
unsigned long __cil_tmp10 ;
unsigned long __cil_tmp11 ;
void *__cil_tmp12 ;
unsigned long __cil_tmp13 ;
unsigned long __cil_tmp14 ;
struct __UTAC__CFLOW_FUNC **mem_15 ;
struct __UTAC__CFLOW_FUNC **mem_16 ;
struct __UTAC__CFLOW_FUNC **mem_17 ;
{
excep = (struct __UTAC__EXCEPTION *)exception;
__cil_tmp5 = (unsigned long )excep;
__cil_tmp6 = __cil_tmp5 + 24;
mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;
cf = *mem_15;
{
while (1) {
while_1_continue: /* CIL Label */ ;
{
__cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;
__cil_tmp8 = (unsigned long )__cil_tmp7;
__cil_tmp9 = (unsigned long )cf;
if (__cil_tmp9 != __cil_tmp8) {
} else {
goto while_1_break;
}
}
{
tmp = cf;
__cil_tmp10 = (unsigned long )cf;
__cil_tmp11 = __cil_tmp10 + 16;
mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11;
cf = *mem_16;
__cil_tmp12 = (void *)tmp;
free(__cil_tmp12);
}
}
while_1_break: /* CIL Label */ ;
}
__cil_tmp13 = (unsigned long )excep;
__cil_tmp14 = __cil_tmp13 + 24;
mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;
*mem_17 = (struct __UTAC__CFLOW_FUNC *)0;
return;
}
}
void __utac__exception__cf_handler_reset(void *exception )
{ struct __UTAC__EXCEPTION *excep ;
struct __UTAC__CFLOW_FUNC *cf ;
unsigned long __cil_tmp5 ;
unsigned long __cil_tmp6 ;
struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;
unsigned long __cil_tmp8 ;
unsigned long __cil_tmp9 ;
int (*__cil_tmp10)(int , int ) ;
unsigned long __cil_tmp11 ;
unsigned long __cil_tmp12 ;
int __cil_tmp13 ;
unsigned long __cil_tmp14 ;
unsigned long __cil_tmp15 ;
struct __UTAC__CFLOW_FUNC **mem_16 ;
int (**mem_17)(int , int ) ;
int *mem_18 ;
struct __UTAC__CFLOW_FUNC **mem_19 ;
{
excep = (struct __UTAC__EXCEPTION *)exception;
__cil_tmp5 = (unsigned long )excep;
__cil_tmp6 = __cil_tmp5 + 24;
mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;
cf = *mem_16;
{
while (1) {
while_2_continue: /* CIL Label */ ;
{
__cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;
__cil_tmp8 = (unsigned long )__cil_tmp7;
__cil_tmp9 = (unsigned long )cf;
if (__cil_tmp9 != __cil_tmp8) {
} else {
goto while_2_break;
}
}
{
mem_17 = (int (**)(int , int ))cf;
__cil_tmp10 = *mem_17;
__cil_tmp11 = (unsigned long )cf;
__cil_tmp12 = __cil_tmp11 + 8;
mem_18 = (int *)__cil_tmp12;
__cil_tmp13 = *mem_18;
(*__cil_tmp10)(4, __cil_tmp13);
__cil_tmp14 = (unsigned long )cf;
__cil_tmp15 = __cil_tmp14 + 16;
mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15;
cf = *mem_19;
}
}
while_2_break: /* CIL Label */ ;
}
{
__utac__exception__cf_handler_free(exception);
}
return;
}
}
void *__utac__error_stack_mgt(void *env , int mode , int count ) ;
static struct __ACC__ERR *head = (struct __ACC__ERR *)0;
void *__utac__error_stack_mgt(void *env , int mode , int count )
{ void *retValue_acc ;
struct __ACC__ERR *new ;
void *tmp ;
struct __ACC__ERR *temp ;
struct __ACC__ERR *next ;
void *excep ;
unsigned long __cil_tmp10 ;
unsigned long __cil_tmp11 ;
unsigned long __cil_tmp12 ;
unsigned long __cil_tmp13 ;
void *__cil_tmp14 ;
unsigned long __cil_tmp15 ;
unsigned long __cil_tmp16 ;
void *__cil_tmp17 ;
void **mem_18 ;
struct __ACC__ERR **mem_19 ;
struct __ACC__ERR **mem_20 ;
void **mem_21 ;
struct __ACC__ERR **mem_22 ;
void **mem_23 ;
void **mem_24 ;
{
if (count == 0) {
return (retValue_acc);
} else {
}
if (mode == 0) {
{
tmp = malloc(16UL);
new = (struct __ACC__ERR *)tmp;
mem_18 = (void **)new;
*mem_18 = env;
__cil_tmp10 = (unsigned long )new;
__cil_tmp11 = __cil_tmp10 + 8;
mem_19 = (struct __ACC__ERR **)__cil_tmp11;
*mem_19 = head;
head = new;
retValue_acc = (void *)new;
}
return (retValue_acc);
} else {
}
if (mode == 1) {
temp = head;
{
while (1) {
while_3_continue: /* CIL Label */ ;
if (count > 1) {
} else {
goto while_3_break;
}
{
__cil_tmp12 = (unsigned long )temp;
__cil_tmp13 = __cil_tmp12 + 8;
mem_20 = (struct __ACC__ERR **)__cil_tmp13;
next = *mem_20;
mem_21 = (void **)temp;
excep = *mem_21;
__cil_tmp14 = (void *)temp;
free(__cil_tmp14);
__utac__exception__cf_handler_reset(excep);
temp = next;
count = count - 1;
}
}
while_3_break: /* CIL Label */ ;
}
{
__cil_tmp15 = (unsigned long )temp;
__cil_tmp16 = __cil_tmp15 + 8;
mem_22 = (struct __ACC__ERR **)__cil_tmp16;
head = *mem_22;
mem_23 = (void **)temp;
excep = *mem_23;
__cil_tmp17 = (void *)temp;
free(__cil_tmp17);
__utac__exception__cf_handler_reset(excep);
retValue_acc = excep;
}
return (retValue_acc);
} else {
}
if (mode == 2) {
if (head) {
mem_24 = (void **)head;
retValue_acc = *mem_24;
return (retValue_acc);
} else {
retValue_acc = (void *)0;
return (retValue_acc);
}
} else {
}
return (retValue_acc);
}
}
void *__utac__get_this_arg(int i , struct JoinPoint *this )
{ void *retValue_acc ;
unsigned long __cil_tmp4 ;
unsigned long __cil_tmp5 ;
int __cil_tmp6 ;
int __cil_tmp7 ;
unsigned long __cil_tmp8 ;
unsigned long __cil_tmp9 ;
void **__cil_tmp10 ;
void **__cil_tmp11 ;
int *mem_12 ;
void ***mem_13 ;
{
if (i > 0) {
{
__cil_tmp4 = (unsigned long )this;
__cil_tmp5 = __cil_tmp4 + 16;
mem_12 = (int *)__cil_tmp5;
__cil_tmp6 = *mem_12;
if (i <= __cil_tmp6) {
} else {
{
__assert_fail("i > 0 && i <= this->argsCount", "libacc.c",
123U, "__utac__get_this_arg");
}
}
}
} else {
{
__assert_fail("i > 0 && i <= this->argsCount", "libacc.c",
123U, "__utac__get_this_arg");
}
}
__cil_tmp7 = i - 1;
__cil_tmp8 = (unsigned long )this;
__cil_tmp9 = __cil_tmp8 + 8;
mem_13 = (void ***)__cil_tmp9;
__cil_tmp10 = *mem_13;
__cil_tmp11 = __cil_tmp10 + __cil_tmp7;
retValue_acc = *__cil_tmp11;
return (retValue_acc);
return (retValue_acc);
}
}
char const *__utac__get_this_argtype(int i , struct JoinPoint *this )
{ char const *retValue_acc ;
unsigned long __cil_tmp4 ;
unsigned long __cil_tmp5 ;
int __cil_tmp6 ;
int __cil_tmp7 ;
unsigned long __cil_tmp8 ;
unsigned long __cil_tmp9 ;
char const **__cil_tmp10 ;
char const **__cil_tmp11 ;
int *mem_12 ;
char const ***mem_13 ;
{
if (i > 0) {
{
__cil_tmp4 = (unsigned long )this;
__cil_tmp5 = __cil_tmp4 + 16;
mem_12 = (int *)__cil_tmp5;
__cil_tmp6 = *mem_12;
if (i <= __cil_tmp6) {
} else {
{
__assert_fail("i > 0 && i <= this->argsCount", "libacc.c",
131U, "__utac__get_this_argtype");
}
}
}
} else {
{
__assert_fail("i > 0 && i <= this->argsCount", "libacc.c",
131U, "__utac__get_this_argtype");
}
}
__cil_tmp7 = i - 1;
__cil_tmp8 = (unsigned long )this;
__cil_tmp9 = __cil_tmp8 + 24;
mem_13 = (char const ***)__cil_tmp9;
__cil_tmp10 = *mem_13;
__cil_tmp11 = __cil_tmp10 + __cil_tmp7;
retValue_acc = *__cil_tmp11;
return (retValue_acc);
return (retValue_acc);
}
}
#pragma merger(0,"Test.i","")
int cleanupTimeShifts = 4;
void cleanup(void)
{ int i ;
int __cil_tmp2 ;
{
{
timeShift();
i = 0;
}
{
while (1) {
while_4_continue: /* CIL Label */ ;
{
__cil_tmp2 = cleanupTimeShifts - 1;
if (i < __cil_tmp2) {
} else {
goto while_4_break;
}
}
{
timeShift();
i = i + 1;
}
}
while_4_break: /* CIL Label */ ;
}
return;
}
}
void Specification2(void)
{
{
{
timeShift();
printPump();
timeShift();
printPump();
timeShift();
printPump();
waterRise();
printPump();
timeShift();
printPump();
changeMethaneLevel();
printPump();
timeShift();
printPump();
cleanup();
}
return;
}
}
void setup(void)
{
{
return;
}
}
void runTest(void)
{
{
{
test();
}
return;
}
}
int main(void)
{ int retValue_acc ;
int tmp ;
{
{
select_helpers();
select_features();
tmp = valid_product();
}
if (tmp) {
{
setup();
runTest();
}
} else {
}
retValue_acc = 0;
return (retValue_acc);
return (retValue_acc);
}
}
|
the_stack_data/73575708.c | #include <stdio.h>
char *month_name(int n);
int main(){
int n;
char *pmonth;
printf("Input number:");
scanf("%d",&n);
pmonth=month_name(n);
printf("%s\n",pmonth);
return 0;
}
char *month_name(int n){
static char *name[]={
"Illegal month","January","February","March","April","May","June","July","August","September","October","November","December"
};
return (n<1 || n>12)?name[0]:name[n];
}
|
the_stack_data/124628.c | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
int
main (int argc, char **argv)
{
int aflag = 0;
int bflag = 0;
char *cvalue = NULL;
int index;
int c;
opterr = 0;
while ((c = getopt (argc, argv, "abc:")) != -1)
switch (c)
{
case 'a':
aflag = 1;
break;
case 'b':
bflag = 1;
break;
case 'c':
cvalue = optarg;
break;
case '?':
if (optopt == 'c')
fprintf (stderr, "Option -%c requires an argument.\n", optopt);
else if (isprint (optopt))
fprintf (stderr, "Unknown option `-%c'.\n", optopt);
else
fprintf (stderr,
"Unknown option character `\\x%x'.\n",
optopt);
return 1;
default:
abort ();
}
printf ("aflag = %d, bflag = %d, cvalue = %s\n",
aflag, bflag, cvalue);
for (index = optind; index < argc; index++)
printf ("Non-option argument %s\n", argv[index]);
return 0;
}
|
the_stack_data/684961.c |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdint.h>
#include <assert.h>
#ifdef BUILD2
#include "u8g2.h"
#endif
extern const uint8_t *u8x8_font_list[] ;
extern char *u8x8_font_names[] ;
extern const uint8_t *u8g2_font_list[] ;
extern char *u8g2_font_names[] ;
#ifdef BUILD2
extern void u8g2_SetupBuffer_TGA(u8g2_t *u8g2, const u8g2_cb_t *u8g2_cb);
extern void tga_save(const char *name);
#endif
/*===================================*/
int add_to_str(char **dest, const char *s)
{
void *t;
if ( *dest == NULL )
{
*dest = strdup(s);
if ( *dest == NULL )
return 0;
}
else
{
t = realloc(*dest, strlen(*dest) + strlen(s) + 1);
if ( t == NULL )
return 0;
*dest = (char *)t;
strcat(*dest, s);
}
return 1;
}
/*
copy file from source_file_name to dest_file_name
*/
int file_copy(const char *source_file_name, const char *dest_file_name)
{
int ch;
FILE *source_fp;
FILE *dest_fp;
source_fp = fopen(source_file_name, "r");
dest_fp = fopen(dest_file_name, "w");
if ( source_fp == NULL || dest_fp == NULL )
return 0;
while( ( ch = fgetc(source_fp) ) != EOF )
fputc(ch, dest_fp);
fclose(source_fp);
fclose(dest_fp);
return 1;
}
/*
Insert "text" between lines "start_line" and "end_line" of file "filename"
*/
int insert_into_file(const char *filename, const char *text, const char *start_line, const char *end_line)
{
static char line[1024*4];
const char *tmpname = "tmp.h";
FILE *source_fp;
FILE *dest_fp;
if ( file_copy(filename, tmpname) == 0 )
return 0;
source_fp = fopen(tmpname, "r");
dest_fp = fopen(filename, "w");
if ( source_fp == NULL || dest_fp == NULL )
return 0;
for(;;)
{
if ( fgets(line, 1024*4, source_fp) == NULL )
break;
if ( strncmp(line, start_line, strlen(start_line)) == 0 )
{
fputs(line, dest_fp);
fputs(text, dest_fp);
fputs("\n", dest_fp);
for(;;)
{
if ( fgets(line, 1024*4, source_fp) == NULL )
break;
if ( strncmp(line, end_line, strlen(end_line)) == 0 )
{
fputs(line, dest_fp);
break;
}
}
}
else
{
fputs(line, dest_fp);
}
}
fclose(source_fp);
fclose(dest_fp);
unlink(tmpname);
return 1;
}
/*===================================*/
struct groupinfo
{
char *groupname;
char *reference;
char *mdfile;
char *mdprefixfile;
};
struct fontinfo
{
//int is_ttf; /* 0 = bdf, 1= ttf */
char *bdfconv_opt;
char *ttf_opt; /* 0 or "-r 72 -p 8" */
char *filename; /* filename including extension */
char *name;
int group; /* group-index */
int kerning_min_distance_per_cent; /* 0: do not generate kerning file */
int build_mode; /* Or'd BM_T, BM_H, BM_M, BM_8 */
int font_mode; /* Or'd FM_C and FM_8 */
int map_mode; /* Or'd MM_F, FM_N and FM_R */
char *map_custom; /* e.g. 32,42-58>32 */
char *map_custom_postfix;
};
typedef void (*cbfn_t)(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms);
struct groupinfo gi[] = {
{ "U8glib", "fntgrpu8g", "../../../../u8g2.wiki/fntgrpu8g.md", "fntgrpu8g.pre" },
{ "X11", "fntgrpx11", "../../../../u8g2.wiki/fntgrpx11.md", "fntgrpx11.pre" },
{ "Fontstruct", "fntgrpfontstruct", "../../../../u8g2.wiki/fntgrpfontstruct.md", "fntgrpfontstruct.pre" }, /* 2 */
{ "cu12", "fntgrpcu12", "../../../../u8g2.wiki/fntgrpcu12.md", "fntgrpcu12.pre" },
{ "Profont", "fntgrpprofont", "../../../../u8g2.wiki/fntgrpprofont.md", "fntgrpprofont.pre" }, /* 4 */
{ "Adobe X11", "fntgrpadobex11", "../../../../u8g2.wiki/fntgrpadobex11.md", "fntgrpadobex11.pre" },
{ "Unifont", "fntgrpunifont", "../../../../u8g2.wiki/fntgrpunifont.md", "fntgrpunifont.pre" }, /* 6 */
{ "Open Game Art", "fntgrpopengameart", "../../../../u8g2.wiki/fntgrpopengameart.md", "fntgrpopengameart.pre" }, /* 7 */
{ "Free Universal", "fntgrpfreeuniversal", "../../../../u8g2.wiki/fntgrpfreeuniversal.md", "fntgrpfreeuniversal.pre" }, /* 8 */
{ "Old Standard", "fntgrpoldstandard", "../../../../u8g2.wiki/fntgrpoldstandard.md", "fntgrpoldstandard.pre" }, /* 9 */
{ "Logisoso", "fntgrplogisoso", "../../../../u8g2.wiki/fntgrplogisoso.md", "fntgrplogisoso.pre" }, /* 10 */
{ "Inconsolata", "fntgrpinconsolata", "../../../../u8g2.wiki/fntgrpinconsolata.md", "fntgrpinconsolata.pre" }, /* 11 */
{ "Codeman38", "fntgrpcodeman38", "../../../../u8g2.wiki/fntgrpcodeman38.md", "fntgrpcodeman38.pre" }, /* 12 */
{ "Academia Sinica","fntgrpacademiasinica", "../../../../u8g2.wiki/fntgrpacademiasinica.md", "fntgrpacademiasinica.pre" }, /* 13 */
{ "Oldschool PC Fonts","fntgrpoldschoolpcfonts", "../../../../u8g2.wiki/fntgrpoldschoolpcfonts.md", "fntgrpoldschoolpcfonts.pre" }, /* 14 */ /* 14 */
{ "crox", "fntgrpcrox", "../../../../u8g2.wiki/fntgrpcrox.md", "fntgrpcrox.pre" }, /* 15 */
{ "efont", "fntgrpefont", "../../../../u8g2.wiki/fntgrpefont.md", "fntgrpefont.pre" }, /* 16 */
{ "Tlwg (Thai-Fonts)","fntgrptlwg", "../../../../u8g2.wiki/fntgrptlwg.md", "fntgrptlwg.pre" }, /* 17 */
{ "NBP", "fntgrpnbp", "../../../../u8g2.wiki/fntgrpnbp.md", "fntgrpnbp.pre" }, /* 18 */
{ "UW ttyp0", "fntgrpttyp0", "../../../../u8g2.wiki/fntgrpttyp0.md", "fntgrpttyp0.pre" }, /* 19 */
{ "Siji Icon Font", "fntgrpsiji", "../../../../u8g2.wiki/fntgrpsiji.md", "fntgrpsiji.pre" }, /* 20 */
{ "Wqy (Chinese Font)", "fntgrpwqy", "../../../../u8g2.wiki/fntgrpwqy.md", "fntgrpwqy.pre" }, /* 21 */
{ "Open Iconic", "fntgrpiconic", "../../../../u8g2.wiki/fntgrpiconic.md", "fntgrpiconic.pre" }, /* 22 */
{ "Persian", "fntgrppersian", "../../../../u8g2.wiki/fntgrppersian.md", "fntgrppersian.pre" }, /* 23 */
{ "Tom-Thumb", "fntgrptomthumb", "../../../../u8g2.wiki/fntgrptomthumb.md", "fntgrptomthumb.pre" }, /* 24 */
{ "Extant", "fntgrpextant", "../../../../u8g2.wiki/fntgrpextant.md", "fntgrpextant.pre" }, /* 25 */
{ "MistressEllipsis", "fntgrpmistressellipsis", "../../../../u8g2.wiki/fntgrpmistressellipsis.md", "fntgrpmistressellipsis.pre" }, /* 26 */
{ "JayWright", "fntgrpjaywright", "../../../../u8g2.wiki/fntgrpjaywright.md", "fntgrpjaywright.pre" }, /* 27 */
{ "Angel", "fntgrpangel", "../../../../u8g2.wiki/fntgrpangel.md", "fntgrpangel.pre" }, /* 28 */
{ "JosephKnightcom", "fntgrpjosephknightcom", "../../../../u8g2.wiki/fntgrpjosephknightcom.md", "fntgrpjosephknightcom.pre" }, /* 29 */
{ "ChristinaAntoinetteNeofotistou", "fntgrpchristinaneofotistou", "../../../../u8g2.wiki/fntgrpchristinaneofotistou.md", "fntgrpchristinaneofotistou.pre" }, /* 30 */
{ "Geoff", "fntgrpgeoff", "../../../../u8g2.wiki/fntgrpgeoff.md", "fntgrpgeoff.pre" }, /* 31 */
{ "Tulamide", "fntgrptulamide", "../../../../u8g2.wiki/fntgrptulamide.md", "fntgrptulamide.pre" }, /* 32 */
{ "GilesBooth", "fntgrpgilesbooth", "../../../../u8g2.wiki/fntgrpgilesbooth.md", "fntgrpgilesbooth.pre" }, /* 33 */
{ "bitfontmaker2", "fntgrpbitfontmaker2", "../../../../u8g2.wiki/fntgrpbitfontmaker2.md", "fntgrpbitfontmaker2.pre" }, /* 34 */
{ "JapanYoshi", "fntgrpjapanyoshi", "../../../../u8g2.wiki/fntgrpjapanyoshi.md", "fntgrpjapanyoshi.pre" }, /* 35 */
{ "Pentacom", "fntgrppentacom", "../../../../u8g2.wiki/fntgrppentacom.md", "fntgrppentacom.pre" }, /* 36 */
};
#define BM_T 1 /* Transparent = build mode 0 proportional */
#define BM_H 2 /* Common Height = build mode 1 */
#define BM_M 4 /* Monospace = build mode 2 */
#define BM_8 8 /* 8x8 = build mode 3 */
#define FM_C 1 /* u8g2 compressed font */
#define FM_8 2 /* u8x8 uncompressed font */
#define MM_F 1 /* full */
#define MM_R 2 /* reduced */
#define MM_U 4 /* uppercase */
#define MM_N 8 /* numbers */
#define MM_C 16 /* custom */
#define MM_M 32 /* map file */
#define MM_E 64 /* extended 32-701,7838 fb00..fb07 */
/*
Greek $370-$3ff _greek
Cyrillic $400-$52f _cyrillic
Armenian 0530–058F
Hebrew 0590–05FF
Thai 0E00–0E7F
Georgian 10A0–10FF
Latin Extended Additional 1E00–1EFF
Greek Extended 1F00–1FFF
*/
struct fontinfo fi[] ={
{ 0, 0, "u8glib_4.bdf", "u8glib_4", 0, 0, BM_T|BM_H, FM_C, MM_F|MM_R, "", "" },
{ 0, 0, "m2icon_5.bdf", "m2icon_5", 0, 0, BM_T, FM_C, MM_F, "", ""},
{ 0, 0, "m2icon_7.bdf", "m2icon_7", 0, 0, BM_T, FM_C, MM_F, "", ""},
{ 0, 0, "m2icon_9.bdf", "m2icon_9", 0, 0, BM_T, FM_C, MM_F, "", ""},
{ 0, 0, "emoticons21.bdf", "emoticons21", 0, 0, BM_T, FM_C, MM_R, "", ""},
{ 0, 0, "battery19.bdf", "battery19", 0, 0, BM_T, FM_C, MM_N, "", ""},
{ 0, 0, "freedoomr10r.bdf", "freedoomr10", 0, 0, BM_T|BM_M, FM_C, MM_U, "", ""},
{ 0, 0, "freedoomr25n.bdf", "freedoomr25", 0, 0, BM_T|BM_M, FM_C, MM_N, "", ""},
{ 0, 0, "7Segments_26x42.bdf", "7Segments_26x42", 0, 0, BM_M, FM_C, MM_N, "", ""},
{ 0, 0, "amstrad_cpc_extended.bdf", "amstrad_cpc_extended", 2, 0, BM_8, FM_C|FM_8, MM_F|MM_R|MM_U|MM_N, "" , ""},
{ 0, 0, "cursor.bdf", "cursor", 1, 0, BM_T, FM_C, MM_C, "0-223>32", "f" },
{ 0, 0, "cursor.bdf", "cursor", 1, 0, BM_T, FM_C, MM_C, "0-80>32", "r" },
{ 0, 0, "micro.bdf", "micro", 1, 0, BM_T|BM_M, FM_C, MM_R|MM_N, "", "" }, /* micro does not have the full set */
{ 0, 0, "4x6.bdf", "4x6", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "4x6.bdf", "4x6", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "5x7.bdf", "5x7", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "5x7.bdf", "5x7", 1, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "5x7.bdf", "5x7", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "5x8.bdf", "5x8", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "5x8.bdf", "5x8", 1, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "5x8.bdf", "5x8", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "6x10.bdf", "6x10", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "6x12.bdf", "6x12", 1, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "6x12.bdf", "6x12", 1, 0, BM_T|BM_M, FM_C, MM_C, "32-255,$20a0-$20bf,$2103,$2109,$2126,$2190-$21bb,$21d0-$21d9,$21e6-$21e9,$23e9-$23fa,$2580-$261f,$2654-$2667,$2680-$2685,$2713-$2718,$274f-$2752", "_symbols" },
{ 0, 0, "6x12.bdf", "6x12", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "6x13.bdf", "6x13", 1, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "6x13.bdf", "6x13", 1, 0, BM_T, FM_C, MM_C, "32-128,$590-$5ff,$fb1d-$fb4f", "_hebrew" },
{ 0, 0, "6x13.bdf", "6x13", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "6x13B.bdf", "6x13B", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "6x13B.bdf", "6x13B", 1, 0, BM_T, FM_C, MM_C, "32-128,$590-$5ff,$fb1d-$fb4f", "_hebrew" },
{ 0, 0, "6x13B.bdf", "6x13B", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "6x13O.bdf", "6x13O", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "7x13.bdf", "7x13", 1, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "7x13.bdf", "7x13", 1, 0, BM_T|BM_M, FM_C, MM_C, "32-255,$20a0-$20bf,$2103,$2109,$2126,$2190-$21bb,$21d0-$21d9,$21e6-$21e9,$23e9-$23fa,$2580-$261f,$2654-$2667,$2680-$2685,$2713-$2718,$274f-$2752", "_symbols" },
{ 0, 0, "7x13.bdf", "7x13", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "7x13B.bdf", "7x13B", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "7x13O.bdf", "7x13O", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "7x14.bdf", "7x14", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "7x14B.bdf", "7x14B", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "8x13.bdf", "8x13", 1, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "8x13.bdf", "8x13", 1, 0, BM_T|BM_M, FM_C, MM_C, "32-255,$20a0-$20bf,$2103,$2109,$2126,$2190-$21bb,$21d0-$21d9,$21e6-$21e9,$23e9-$23fa,$2580-$261f,$2654-$2667,$2680-$2685,$2713-$2718,$274f-$2752", "_symbols" },
{ 0, 0, "8x13.bdf", "8x13", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "8x13B.bdf", "8x13B", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "8x13O.bdf", "8x13O", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
//#ifdef TMP
{ 0, 0, "9x15.bdf", "9x15", 1, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "9x15.bdf", "9x15", 1, 0, BM_T|BM_M, FM_C, MM_C, "32-255,$20a0-$20bf,$2103,$2109,$2126,$2190-$21bb,$21d0-$21d9,$21e6-$21e9,$23e9-$23fa,$2580-$261f,$2654-$2667,$2680-$2685,$2713-$2718,$274f-$2752", "_symbols" },
{ 0, 0, "9x15.bdf", "9x15", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "9x15B.bdf", "9x15B", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "9x18.bdf", "9x18", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "9x18B.bdf", "9x18B", 1, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "10x20.bdf", "10x20", 1, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "10x20.bdf", "10x20", 1, 0, BM_T, FM_C, MM_C, "32-128,$370-$3ff", "_greek" },
{ 0, 0, "10x20.bdf", "10x20", 1, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "10x20.bdf", "10x20", 1, 35, BM_T, FM_C, MM_C, "32-128,$600-$6ff,$FB50-$FBB1,$FE70-$FEFF,x32-64,x91-96,x123-191,x247,x697-879,x32-$5ff", "_arabic" },
{ "-y -2 -th 1 -tv 2", 0, "8x13.bdf", "8x13_1x2", 1, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -2 -th 1 -tv 2", 0, "8x13B.bdf", "8x13B_1x2", 1, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -1 -x -1 -th 1 -tv 2", 0, "7x14.bdf", "7x14_1x2", 1, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -1 -x -1 -th 1 -tv 2", 0, "7x14B.bdf", "7x14B_1x2", 1, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ 0, 0, "siji_with_6x10.bdf", "siji", 20, 0, BM_T, FM_C, MM_C, "32-128,$e000-$ffff", "_6x10" },
{ 0, 0, "tom-thumb.bdf", "tom_thumb_4x6", 24, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, 0, "tom-thumb.bdf", "tom_thumb_4x6", 24, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
/*
t0 includes the following pages/language support:
Greek $370-$3ff _greek
Cyrillic $400-$52f _cyrillic
Armenian 0530–058F
Hebrew 0590–05FF
Thai 0E00–0E7F
Georgian 10A0–10FF
Latin Extended Additional 1E00–1EFF
Greek Extended 1F00–1FFF
*/
{ 0, 0, "t0-11-uni.bdf", "t0_11", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-11-uni.bdf", "t0_11", 19, 0, BM_T, FM_C, MM_C, "$0020-$FFF0", "_all" },
{ 0, 0, "t0-11b-uni.bdf", "t0_11b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-12-uni.bdf", "t0_12", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-12b-uni.bdf", "t0_12b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-13-uni.bdf", "t0_13", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-13b-uni.bdf", "t0_13b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-14-uni.bdf", "t0_14", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-14b-uni.bdf", "t0_14b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-15-uni.bdf", "t0_15", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-15b-uni.bdf", "t0_15b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-16-uni.bdf", "t0_16", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-16b-uni.bdf", "t0_16b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-17-uni.bdf", "t0_17", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-17b-uni.bdf", "t0_17b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-18-uni.bdf", "t0_18", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-18b-uni.bdf", "t0_18b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-22-uni.bdf", "t0_22", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "t0-22b-uni.bdf", "t0_22b", 19, 0, BM_T|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "open_iconic_all_1x.bdf", "open_iconic_all_1x", 22, 0, BM_T, FM_C, MM_C, "32-400", "" },
{ 0, 0, "open_iconic_app_1x.bdf", "open_iconic_app_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_arrow_1x.bdf", "open_iconic_arrow_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_check_1x.bdf", "open_iconic_check_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_email_1x.bdf", "open_iconic_email_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_embedded_1x.bdf", "open_iconic_embedded_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_gui_1x.bdf", "open_iconic_gui_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_human_1x.bdf", "open_iconic_human_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_mime_1x.bdf", "open_iconic_mime_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_other_1x.bdf", "open_iconic_other_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_play_1x.bdf", "open_iconic_play_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_text_1x.bdf", "open_iconic_text_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_thing_1x.bdf", "open_iconic_thing_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_weather_1x.bdf", "open_iconic_weather_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_www_1x.bdf", "open_iconic_www_1x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ "-th 1 -tv 1", 0, "open_iconic_arrow_1x.bdf", "open_iconic_arrow_1x1", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 1 -tv 1", 0, "open_iconic_check_1x.bdf", "open_iconic_check_1x1", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 1 -tv 1", 0, "open_iconic_embedded_1x.bdf", "open_iconic_embedded_1x1", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 1 -tv 1", 0, "open_iconic_play_1x.bdf", "open_iconic_play_1x1", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 1 -tv 1", 0, "open_iconic_thing_1x.bdf", "open_iconic_thing_1x1", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 1 -tv 1", 0, "open_iconic_weather_1x.bdf", "open_iconic_weather_1x1", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ 0, 0, "open_iconic_all_2x.bdf", "open_iconic_all_2x", 22, 0, BM_T, FM_C, MM_C, "32-400", "" },
{ 0, 0, "open_iconic_app_2x.bdf", "open_iconic_app_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_arrow_2x.bdf", "open_iconic_arrow_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_check_2x.bdf", "open_iconic_check_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_email_2x.bdf", "open_iconic_email_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_embedded_2x.bdf", "open_iconic_embedded_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_gui_2x.bdf", "open_iconic_gui_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_human_2x.bdf", "open_iconic_human_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_mime_2x.bdf", "open_iconic_mime_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_other_2x.bdf", "open_iconic_other_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_play_2x.bdf", "open_iconic_play_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_text_2x.bdf", "open_iconic_text_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_thing_2x.bdf", "open_iconic_thing_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_weather_2x.bdf", "open_iconic_weather_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_www_2x.bdf", "open_iconic_www_2x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ "-th 2 -tv 2", 0, "open_iconic_arrow_2x.bdf", "open_iconic_arrow_2x2", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 2 -tv 2", 0, "open_iconic_check_2x.bdf", "open_iconic_check_2x2", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 2 -tv 2", 0, "open_iconic_embedded_2x.bdf", "open_iconic_embedded_2x2", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 2 -tv 2", 0, "open_iconic_play_2x.bdf", "open_iconic_play_2x2", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 2 -tv 2", 0, "open_iconic_thing_2x.bdf", "open_iconic_thing_2x2", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 2 -tv 2", 0, "open_iconic_weather_2x.bdf", "open_iconic_weather_2x2", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ 0, 0, "open_iconic_all_4x.bdf", "open_iconic_all_4x", 22, 0, BM_T, FM_C, MM_C, "32-400", "" },
{ 0, 0, "open_iconic_app_4x.bdf", "open_iconic_app_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_arrow_4x.bdf", "open_iconic_arrow_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_check_4x.bdf", "open_iconic_check_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_email_4x.bdf", "open_iconic_email_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_embedded_4x.bdf", "open_iconic_embedded_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_gui_4x.bdf", "open_iconic_gui_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_human_4x.bdf", "open_iconic_human_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_mime_4x.bdf", "open_iconic_mime_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_other_4x.bdf", "open_iconic_other_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_play_4x.bdf", "open_iconic_play_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_text_4x.bdf", "open_iconic_text_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_thing_4x.bdf", "open_iconic_thing_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_weather_4x.bdf", "open_iconic_weather_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_www_4x.bdf", "open_iconic_www_4x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ "-th 4 -tv 4", 0, "open_iconic_arrow_4x.bdf", "open_iconic_arrow_4x4", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 4 -tv 4", 0, "open_iconic_check_4x.bdf", "open_iconic_check_4x4", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 4 -tv 4", 0, "open_iconic_embedded_4x.bdf", "open_iconic_embedded_4x4", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 4 -tv 4", 0, "open_iconic_play_4x.bdf", "open_iconic_play_4x4", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 4 -tv 4", 0, "open_iconic_thing_4x.bdf", "open_iconic_thing_4x4", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 4 -tv 4", 0, "open_iconic_weather_4x.bdf", "open_iconic_weather_4x4", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ 0, 0, "open_iconic_all_6x.bdf", "open_iconic_all_6x", 22, 0, BM_T, FM_C, MM_C, "32-400", "" },
{ 0, 0, "open_iconic_app_6x.bdf", "open_iconic_app_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_arrow_6x.bdf", "open_iconic_arrow_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_check_6x.bdf", "open_iconic_check_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_email_6x.bdf", "open_iconic_email_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_embedded_6x.bdf", "open_iconic_embedded_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_gui_6x.bdf", "open_iconic_gui_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_human_6x.bdf", "open_iconic_human_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_mime_6x.bdf", "open_iconic_mime_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_other_6x.bdf", "open_iconic_other_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_play_6x.bdf", "open_iconic_play_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_text_6x.bdf", "open_iconic_text_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_thing_6x.bdf", "open_iconic_thing_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_weather_6x.bdf", "open_iconic_weather_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_www_6x.bdf", "open_iconic_www_6x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_all_8x.bdf", "open_iconic_all_8x", 22, 0, BM_T, FM_C, MM_C, "32-400", "" },
{ 0, 0, "open_iconic_app_8x.bdf", "open_iconic_app_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_arrow_8x.bdf", "open_iconic_arrow_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_check_8x.bdf", "open_iconic_check_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_email_8x.bdf", "open_iconic_email_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_embedded_8x.bdf", "open_iconic_embedded_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_gui_8x.bdf", "open_iconic_gui_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_human_8x.bdf", "open_iconic_human_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_mime_8x.bdf", "open_iconic_mime_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_other_8x.bdf", "open_iconic_other_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_play_8x.bdf", "open_iconic_play_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_text_8x.bdf", "open_iconic_text_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_thing_8x.bdf", "open_iconic_thing_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_weather_8x.bdf", "open_iconic_weather_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ 0, 0, "open_iconic_www_8x.bdf", "open_iconic_www_8x", 22, 0, BM_T, FM_C, MM_C, "32-300", "" },
{ "-th 8 -tv 8", 0, "open_iconic_arrow_8x.bdf", "open_iconic_arrow_8x8", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 8 -tv 8", 0, "open_iconic_check_8x.bdf", "open_iconic_check_8x8", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 8 -tv 8", 0, "open_iconic_embedded_8x.bdf", "open_iconic_embedded_8x8", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 8 -tv 8", 0, "open_iconic_play_8x.bdf", "open_iconic_play_8x8", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 8 -tv 8", 0, "open_iconic_thing_8x.bdf", "open_iconic_thing_8x8", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ "-th 8 -tv 8", 0, "open_iconic_weather_8x.bdf", "open_iconic_weather_8x8", 22, 0, BM_8, FM_8, MM_C, "32-255", "" },
{ 0, 0, "profont10.bdf", "profont10", 4, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "profont11.bdf", "profont11", 4, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "profont12.bdf", "profont12", 4, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "profont15.bdf", "profont15", 4, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "profont17.bdf", "profont17", 4, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "profont22.bdf", "profont22", 4, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "profont29.bdf", "profont29", 4, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ "-y 0 -th 2 -tv 3", 0, "profont29.bdf", "profont29_2x3", 4, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
/* Persian */
{ 0, "-a -r 72 -p 10", "Samim.ttf", "samim_10", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-a -r 72 -p 12", "Samim.ttf", "samim_12", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-a -r 72 -p 14", "Samim.ttf", "samim_14", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-a -r 72 -p 16", "Samim.ttf", "samim_16", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-a -r 72 -p 10", "Samim-FD.ttf", "samim_fd_10", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-a -r 72 -p 12", "Samim-FD.ttf", "samim_fd_12", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-a -r 72 -p 14", "Samim-FD.ttf", "samim_fd_14", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-a -r 72 -p 16", "Samim-FD.ttf", "samim_fd_16", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 10", "GanjNamehSans-Regular.ttf", "ganj_nameh_sans10", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 12", "GanjNamehSans-Regular.ttf", "ganj_nameh_sans12", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 14", "GanjNamehSans-Regular.ttf", "ganj_nameh_sans14", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 16", "GanjNamehSans-Regular.ttf", "ganj_nameh_sans16", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 8", "IranianSansRegular.ttf", "iranian_sans_8", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 10", "IranianSansRegular.ttf", "iranian_sans_10", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 12", "IranianSansRegular.ttf", "iranian_sans_12", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 14", "IranianSansRegular.ttf", "iranian_sans_14", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
{ 0, "-r 72 -p 16", "IranianSansRegular.ttf", "iranian_sans_16", 23, 0, BM_T, FM_C, MM_C, "32-65500", "_all" },
/* NBP */
{ 0, "-r 72 -p 16", "MOZART_0.ttf", "mozart_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "MOZART_0.ttf", "mozart_nbp", 18, 0, BM_T|BM_H, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "glasstown_nbp.ttf", "glasstown_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "glasstown_nbp.ttf", "glasstown_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "shylock_nbp.ttf", "shylock_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "shylock_nbp.ttf", "shylock_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "RENT_0.ttf", "roentgen_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "RENT_0.ttf", "roentgen_nbp", 18, 0, BM_T|BM_H, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "CALIBRATE1.ttf", "calibration_gothic_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "CALIBRATE1.ttf", "calibration_gothic_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "smart_patrol_nbp.ttf", "smart_patrol_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "prospero_bold_nbp.ttf", "prospero_bold_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "prospero_nbp.ttf", "prospero_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "BALRG_0.ttf", "balthasar_regular_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 32", "BALTT_0.ttf", "balthasar_titling_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 8", "synchronizer_nbp.ttf", "synchronizer_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "mercutio_basic.ttf", "mercutio_basic_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "mercutio_basic.ttf", "mercutio_basic_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "mercutio_sc.ttf", "mercutio_sc_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "mercutio_sc.ttf", "mercutio_sc_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "MIRANDA.ttf", "miranda_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "nine0.ttf", "nine_by_five_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "nine0.ttf", "nine_by_five_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "ROSEN_0.ttf", "rosencrantz_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "ROSEN_0.ttf", "rosencrantz_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "GUILD_0.ttf", "guildenstern_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "GUILD_0.ttf", "guildenstern_nbp", 18, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "astra0.ttf", "astragal_nbp", 18, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
/* Extant, 25 */
{ 0, "-r 72 -p 16", "HabsburgChancery.ttf", "habsburgchancery", 25, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "HabsburgChancery.ttf", "habsburgchancery", 25, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "MissingPlanet.ttf", "missingplanet", 25, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "MissingPlanet.ttf", "missingplanet", 25, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "OrdinaryBasis.ttf", "ordinarybasis", 25, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "OrdinaryBasis.ttf", "ordinarybasis", 25, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "PixelMordred.ttf", "pixelmordred", 25, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "PixelMordred.ttf", "pixelmordred", 25, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "SecretaryHand.ttf", "secretaryhand", 25, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "SecretaryHand.ttf", "secretaryhand", 25, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
/* MistressEllipsis, 26 */
{ 0, "-r 72 -p 16", "Beanstalk.ttf", "beanstalk_mel", 26, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "Cube.ttf", "cube_mel", 26, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "Mademoiselle.ttf", "mademoiselle_mel", 26, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "PieceOfCake.ttf", "pieceofcake_mel", 26, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "Press.ttf", "press_mel", 26, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "RePress.ttf", "repress_mel", 26, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "Sticker.ttf", "sticker_mel", 26, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
/* JayWright, 27 */
{ 0, "-r 72 -p 16", "CelibateMonk.ttf", "celibatemonk", 27, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "DisrespectfulTeenager.ttf", "disrespectfulteenager", 27, 0, BM_T, FM_C, MM_U, "", "" },
{ 0, "-r 72 -p 16", "MichaelMouse.ttf", "michaelmouse", 27, 0, BM_T, FM_C, MM_U, "", "" },
{ 0, "-r 72 -p 16", "SandyForest.ttf", "sandyforest", 27, 0, BM_T, FM_C, MM_R|MM_U|MM_N, "", "" },
/* Angel, 28 */
{ 0, "-r 72 -p 16", "CupcakeMeToYourLeader.ttf", "cupcakemetoyourleader", 28, 0, BM_T, FM_C, MM_R|MM_U|MM_N, "", "" },
{ 0, "-r 72 -p 16", "OldWizard.ttf", "oldwizard", 28, 0, BM_T, FM_C, MM_F|MM_R|MM_U|MM_N, "", "" },
{ 0, "-r 72 -p 16", "Squirrel.ttf", "squirrel", 28, 0, BM_T, FM_C, MM_R|MM_U|MM_N, "", "" },
/* JosephKnightcom, 29 */
{ 0, "-r 72 -p 16", "DiodeSemiMono.ttf", "diodesemimono", 29, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "Questgiver.ttf", "questgiver", 29, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "Seraphimb1.ttf", "seraphimb1", 29, 0, BM_T, FM_C, MM_R, "", "" },
/* ChristinaAntoinetteNeofotistou, 30 */
{ 0, "-r 72 -p 16", "JinxedWizards.ttf", "jinxedwizards", 30, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "LastPriestess.ttf", "lastpriestess", 30, 0, BM_T, FM_C, MM_U|MM_R, "", "" },
/* Geoff, 31 */
{ 0, "-r 72 -p 16", "BitCasual.ttf", "bitcasual", 31, 0, BM_T, FM_C, MM_N|MM_U|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "BitCasual.ttf", "bitcasual", 31, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "Koleeko.ttf", "koleeko", 31, 0, BM_T, FM_C, MM_N|MM_U|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "TenFatGuys.ttf", "tenfatguys", 31, 0, BM_T, FM_C, MM_N|MM_U|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "TenFatGuys.ttf", "tenfatguys", 31, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "TenStamps.ttf", "tenstamps", 31, 0, BM_M, FM_C, MM_N|MM_U|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "TenThinGuys.ttf", "tenthinguys", 31, 0, BM_T, FM_C, MM_N|MM_U|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "TenThinGuys.ttf", "tenthinguys", 31, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "TenThinnerGuys.ttf", "tenthinnerguys", 31, 0, BM_T, FM_C, MM_N|MM_U|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "TenThinnerGuys.ttf", "tenthinnerguys", 31, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "TwelveDings.ttf", "twelvedings", 31, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
/* tulamide, 32 */
{ 0, "-r 72 -p 16", "Fewture.ttf", "fewture", 32, 0, BM_T, FM_C, MM_N|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "Halftone.ttf", "halftone", 32, 0, BM_T, FM_C, MM_N|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "Nerhoe.ttf", "nerhoe", 32, 0, BM_T, FM_C, MM_N|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "Oskool.ttf", "oskool", 32, 0, BM_T, FM_C, MM_N|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "TinyTim.ttf", "tinytim", 32, 0, BM_T, FM_C, MM_N|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "TooseOrnament.ttf", "tooseornament", 32, 0, BM_T, FM_C, MM_N|MM_R|MM_F, "", "" },
/* GilesBooth, 33*/
{ 0, "-r 72 -p 16", "Bauhaus2015.ttf", "bauhaus2015", 33, 0, BM_T, FM_C, MM_N|MM_R, "", "" },
{ 0, "-r 72 -p 16", "FindersKeepers.ttf", "finderskeepers", 33, 0, BM_T, FM_C, MM_N|MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "SirClivetheBold.ttf", "sirclivethebold", 33, 0, BM_T, FM_C, MM_N|MM_R, "", "" },
{ 0, "-r 72 -p 16", "SirClive.ttf", "sirclive", 33, 0, BM_T, FM_C, MM_N|MM_R, "", "" },
/* bm2, 34*/
{ 0, "-r 72 -p 16", "Adventurer.ttf", "adventurer", 34, 0, BM_T, FM_C, MM_R|MM_F, "", "" },
{ 0, "-r 72 -p 16", "Adventurer.ttf", "adventurer", 34, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "BracketedBabies.ttf", "bracketedbabies", 34, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "Frikativ.ttf", "frikativ", 34, 0, BM_T, FM_C, MM_F|MM_R, "", "" },
{ 0, "-r 72 -p 16", "Frikativ.ttf", "frikativ", 34, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "FancyPixels.ttf", "fancypixels", 34, 0, BM_T, FM_C, MM_F|MM_R, "", "" },
{ 0, "-r 72 -p 16", "HEAVYBOTTOM.ttf", "heavybottom", 34, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "IconQuadPix.ttf", "iconquadpix", 34, 0, BM_M, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "LastApprenticeBold.ttf", "lastapprenticebold", 34, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "LastApprenticeThin.ttf", "lastapprenticethin", 34, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "Tallpix.ttf", "tallpix", 34, 0, BM_T, FM_C, MM_R, "", "" },
/* JapanYoshi, 35*/
{ 0, "-r 72 -p 16", "BBSesque.ttf", "BBSesque", 35, 0, BM_T, FM_C, MM_R|MM_F|MM_E, "", "" },
{ 0, "-r 72 -p 16", "Born2bSportySlab.ttf", "Born2bSportySlab", 35, 0, BM_T, FM_C, MM_R|MM_F|MM_E, "", "" },
{ 0, "-r 72 -p 16", "Born2bSportySlab.ttf", "Born2bSportySlab", 35, 0, BM_T, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "Born2bSportyV2.ttf", "Born2bSportyV2", 35, 0, BM_T, FM_C, MM_R|MM_F|MM_E, "", "" },
{ 0, "-r 72 -p 16", "CursivePixel.ttf", "CursivePixel", 35, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "Engrish.ttf", "Engrish", 35, 0, BM_T, FM_C, MM_F|MM_R, "", "" },
{ 0, "-r 72 -p 16", "ImpactBits.ttf", "ImpactBits", 35, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "IPAandRUSLCD.ttf", "IPAandRUSLCD", 35, 0, BM_T, FM_C, MM_R|MM_F|MM_E, "", "" },
/* Pentacom, 36*/
{ 0, "-r 72 -p 16", "HelvetiPixel.ttf", "HelvetiPixel", 36, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "TimesNewPixel.ttf", "TimesNewPixel", 36, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "BitTypeWriter.ttf", "BitTypeWriter", 36, 0, BM_T, FM_C, MM_R |MM_E, "", "" },
{ 0, "-r 72 -p 16", "Georgia7px.ttf", "Georgia7px", 36, 0, BM_T, FM_C, MM_R|MM_F|MM_E, "", "" },
{ 0, "-r 72 -p 16", "Wizzard.ttf", "Wizzard", 36, 0, BM_T, FM_C, MM_R, "", "" },
{ 0, "-r 72 -p 16", "HelvetiPixelOutline.ttf", "HelvetiPixelOutline", 36, 0, BM_T, FM_C, MM_R|MM_E, "", "" },
{ 0, "-r 72 -p 16", "Untitled16PixelSansSerifBitmapTestFont.ttf", "Untitled16PixelSansSerifBitmap", 36, 0, BM_T, FM_C, MM_R, "", "" },
/* thai fonts are not unicode encoded, so map the thai chars to their correct unicode position 128-255>3552 */
{ 0, 0, "etl14-thai.bdf", "etl14thai", 17, 0, BM_T, FM_C, MM_C, "32-127,128-255>3552", "" },
{ 0, 0, "etl16-thai.bdf", "etl16thai", 17, 0, BM_T, FM_C, MM_C, "32-127,128-255>3552", "" },
{ 0, 0, "etl24-thai.bdf", "etl24thai", 17, 0, BM_T, FM_C, MM_C, "32-127,128-255>3552", "" },
/* crox fonts are CP1251 encoded */
{ 0, 0, "win_crox1cb.bdf", "crox1cb", 15,0,BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox1c.bdf", "crox1c", 15,0,BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox1hb.bdf", "crox1hb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox1h.bdf", "crox1h", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox1tb.bdf", "crox1tb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox1t.bdf", "crox1t", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox2cb.bdf", "crox2cb", 15,0,BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox2c.bdf", "crox2c", 15,0,BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox2hb.bdf", "crox2hb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox2h.bdf", "crox2h", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox2tb.bdf", "crox2tb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox2t.bdf", "crox2t", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox3cb.bdf", "crox3cb", 15,0,BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox3c.bdf", "crox3c", 15,0,BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox3hb.bdf", "crox3hb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox3h.bdf", "crox3h", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox3tb.bdf", "crox3tb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox3t.bdf", "crox3t", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox4hb.bdf", "crox4hb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox4h.bdf", "crox4h", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox4tb.bdf", "crox4tb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox4t.bdf", "crox4t", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox5hb.bdf", "crox5hb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox5h.bdf", "crox5h", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox5tb.bdf", "crox5tb", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "win_crox5t.bdf", "crox5t", 15,0,BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "cu12.bdf", "cu12", 3, 0, BM_T|BM_H|BM_M, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "cu12.bdf", "cu12", 3, 0, BM_T|BM_H, FM_C, MM_C, "32-255,$20a0-$20bf,$2103,$2109,$2126,$2190-$21bb,$21d0-$21d9,$21e6-$21e9,$23e9-$23fa,$2580-$261f,$2654-$2667,$2680-$2685,$2713-$2718,$274f-$2752", "_symbols" },
{ 0, 0, "cu12.bdf", "cu12", 3, 0, BM_T, FM_C, MM_C, "32-128,$370-$3ff", "_greek" },
{ 0, 0, "cu12.bdf", "cu12", 3, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "cu12.bdf", "cu12", 3, 0, BM_T, FM_C, MM_C, "32-128,$f00-$fff", "_tibetan" },
{ 0, 0, "cu12.bdf", "cu12", 3, 0, BM_T, FM_C, MM_C, "32-128,$590-$5ff,$fb1d-$fb4f", "_hebrew" },
{ 0, 0, "cu12.bdf", "cu12", 3, 35, BM_T, FM_C, MM_C, "32-128,$600-$6ff,$FB50-$FBB1,$FE70-$FEFF,x32-64,x91-96,x123-191,x247,x697-879,x32-$5ff", "_arabic" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_R|MM_F|MM_E, "", "" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-255", "_latin" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-701", "_extended" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "9216-9471", "_72_73" }, // takeover from u8glib
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-127,9216-9471", "_0_72_73" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "9600-9727", "_75" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-127,9600-9727", "_0_75" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "9728-9855", "_76" }, // takeover from u8glib
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-127,9728-9855", "_0_76" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "9856-9983", "_77" }, // takeover from u8glib
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-127,9856-9983", "_0_77" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "9984-10240", "_78_79" }, // takeover from u8glib
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-127,9984-10240", "_0_78_79" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "11008-11135", "_86" }, // takeover from u8glib
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-127,11008-11135", "_0_86" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-128,$370-$3ff", "_greek" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-128,$590-$5ff,$fb1d-$fb4f", "_hebrew" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-128,$980-$9ff", "_bengali" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-128,$f00-$fff", "_tibetan" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-128,$600-$6ff,$750-$77f,$fb50-$fdff,$fe70-$feff", "_urdu" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-127,$104-$107,$118-$119,$141-$144,$15a-$15b,$179-$17c,$d3,$f3", "_polish" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "32-128,$900-$97f,$1cd0-$1cff,$a8e0-$a8ff", "_devanagari" }, /* Hindi, issue 584 */
{ 0, 0, "unifont.bdf", "unifont", 6, 35, BM_T, FM_C, MM_C, "32-128,$600-$6ff,$FB50-$FBB1,$FE70-$FEFF,x32-64,x91-96,x123-191,x247,x697-879,x32-$5ff", "_arabic" },
/*
$20a0-$20bf currency symbols
$2103 Circle C-
$2109 Circle F
$2126 Ohm
$2190-$21bb single arrow
$21d0-$21d9 double arrow
$21e6-$21e9 double arrow
$23e9-$23fa music player symbols
$2580-$261f various symbols
$2654-$2667 chess and cards
$2680-$2685 dice
$2713-$2718 yes/no
$274f-$2752 3d box
$1f600-$1f64f emoticons
*/
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T|BM_H, FM_C, MM_C, "32-255,$20a0-$20bf,$2103,$2109,$2126,$2190-$21bb,$21d0-$21d9,$21e6-$21e9,$23e9-$23fa,$2580-$261f,$2654-$2667,$2680-$2685,$2713-$2718,$274f-$2752", "_symbols" },
{ 0, 0, "unifont_upper.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "$01f600-$01f64f>$20, $01f910-$01f92f>$70, $01f970-$01f971>$90, $01f973-$01f976>$92,$01f97a>$96, $01f9b8-$01f9b9>$97, $01f9d0-$01f9d6>$99", "_emoticons" },
{ 0, 0, "unifont_upper.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "$01f400-$01f43f>$20,$01f980-$01f9af>$60", "_animals" },
{ 0, 0, "unifont_upper.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "$01f030-$01f093>$20", "_domino" },
{ 0, 0, "unifont_upper.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "$01f0a0-$01f0f5>$20", "_cards" },
{ 0, 0, "unifont_upper.bdf", "unifont", 6, 0, BM_T, FM_C, MM_C, "$01f310-$01f32c>$20", "_weather" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "chinese1.map", "_chinese1" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese2" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "chinese3.map", "_chinese3" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "japanese3.map", "_japanese3" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "korean1.map", "_korean1" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "korean2.map", "_korean2" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "vietnamese1.map", "_vietnamese1" },
{ 0, 0, "unifont.bdf", "unifont", 6, 0, BM_T, FM_C, MM_M, "vietnamese2.map", "_vietnamese2" },
{ 0, 0, "gb16st.bdf", "gb16st", 13, 0, BM_T, FM_C, MM_M, "chinese1.map", "_1" },
{ 0, 0, "gb16st.bdf", "gb16st", 13, 0, BM_T, FM_C, MM_M, "chinese2.map", "_2" },
{ 0, 0, "gb16st.bdf", "gb16st", 13, 0, BM_T, FM_C, MM_M, "chinese3.map", "_3" },
{ 0, 0, "gb24st.bdf", "gb24st", 13, 0, BM_T, FM_C, MM_M, "chinese1.map", "_1" },
{ 0, 0, "gb24st.bdf", "gb24st", 13, 0, BM_T, FM_C, MM_M, "chinese2.map", "_2" },
{ 0, 0, "gb24st.bdf", "gb24st", 13, 0, BM_T, FM_C, MM_M, "chinese3.map", "_3" },
{ 0, 0, "wenquanyi_9pt.bdf", "wqy12", 21, 0, BM_T, FM_C, MM_M, "chinese1.map", "_chinese1" },
{ 0, 0, "wenquanyi_9pt.bdf", "wqy12", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese2" },
{ 0, 0, "wenquanyi_9pt.bdf", "wqy12", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese3" },
{ 0, 0, "wenquanyi_9pt.bdf", "wqy12", 21, 0, BM_T, FM_C, MM_M, "gb2312.map", "_gb2312" },
{ 0, 0, "wenquanyi_9pt.bdf", "wqy12", 21, 0, BM_T, FM_C, MM_M, "gb2312a.map", "_gb2312a" },
{ 0, 0, "wenquanyi_9pt.bdf", "wqy12", 21, 0, BM_T, FM_C, MM_M, "gb2312b.map", "_gb2312b" },
{ 0, 0, "wenquanyi_10pt.bdf", "wqy13", 21, 0, BM_T, FM_C, MM_M, "chinese1.map", "_chinese1" },
{ 0, 0, "wenquanyi_10pt.bdf", "wqy13", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese2" },
{ 0, 0, "wenquanyi_10pt.bdf", "wqy13", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese3" },
{ 0, 0, "wenquanyi_10pt.bdf", "wqy13", 21, 0, BM_T, FM_C, MM_M, "gb2312.map", "_gb2312" },
{ 0, 0, "wenquanyi_10pt.bdf", "wqy13", 21, 0, BM_T, FM_C, MM_M, "gb2312a.map", "_gb2312a" },
{ 0, 0, "wenquanyi_10pt.bdf", "wqy13", 21, 0, BM_T, FM_C, MM_M, "gb2312b.map", "_gb2312b" },
{ 0, 0, "wenquanyi_13px.bdf", "wqy14", 21, 0, BM_T, FM_C, MM_M, "chinese1.map", "_chinese1" },
{ 0, 0, "wenquanyi_13px.bdf", "wqy14", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese2" },
{ 0, 0, "wenquanyi_13px.bdf", "wqy14", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese3" },
{ 0, 0, "wenquanyi_13px.bdf", "wqy14", 21, 0, BM_T, FM_C, MM_M, "gb2312.map", "_gb2312" },
{ 0, 0, "wenquanyi_13px.bdf", "wqy14", 21, 0, BM_T, FM_C, MM_M, "gb2312a.map", "_gb2312a" },
{ 0, 0, "wenquanyi_13px.bdf", "wqy14", 21, 0, BM_T, FM_C, MM_M, "gb2312b.map", "_gb2312b" },
{ 0, 0, "wenquanyi_11pt.bdf", "wqy15", 21, 0, BM_T, FM_C, MM_M, "chinese1.map", "_chinese1" },
{ 0, 0, "wenquanyi_11pt.bdf", "wqy15", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese2" },
{ 0, 0, "wenquanyi_11pt.bdf", "wqy15", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese3" },
{ 0, 0, "wenquanyi_11pt.bdf", "wqy15", 21, 0, BM_T, FM_C, MM_M, "gb2312.map", "_gb2312" },
{ 0, 0, "wenquanyi_11pt.bdf", "wqy15", 21, 0, BM_T, FM_C, MM_M, "gb2312a.map", "_gb2312a" },
{ 0, 0, "wenquanyi_11pt.bdf", "wqy15", 21, 0, BM_T, FM_C, MM_M, "gb2312b.map", "_gb2312b" },
{ 0, 0, "wenquanyi_12pt.bdf", "wqy16", 21, 0, BM_T, FM_C, MM_M, "chinese1.map", "_chinese1" },
{ 0, 0, "wenquanyi_12pt.bdf", "wqy16", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese2" },
{ 0, 0, "wenquanyi_12pt.bdf", "wqy16", 21, 0, BM_T, FM_C, MM_M, "chinese2.map", "_chinese3" },
{ 0, 0, "wenquanyi_12pt.bdf", "wqy16", 21, 0, BM_T, FM_C, MM_M, "gb2312.map", "_gb2312" },
{ 0, 0, "wenquanyi_12pt.bdf", "wqy16", 21, 0, BM_T, FM_C, MM_M, "gb2312a.map", "_gb2312a" },
{ 0, 0, "wenquanyi_12pt.bdf", "wqy16", 21, 0, BM_T, FM_C, MM_M, "gb2312b.map", "_gb2312b" },
//#endif /* TMP */
{ 0, 0, "b10.bdf", "b10", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b10.bdf", "b10", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
//#ifdef TMP
{ 0, 0, "b10_b.bdf", "b10_b", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b10_b.bdf", "b10_b", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "f10.bdf", "f10", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "f10.bdf", "f10", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "f10_b.bdf", "f10_b", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "f10_b.bdf", "f10_b", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b12.bdf", "b12", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b12.bdf", "b12", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b12.bdf", "b12", 16, 0, BM_T, FM_C, MM_M, "japanese3.map", "_japanese3" },
{ 0, 0, "b12_b.bdf", "b12_b", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b12_b.bdf", "b12_b", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b12_b.bdf", "b12_b", 16, 0, BM_T, FM_C, MM_M, "japanese3.map", "_japanese3" },
/* does not work, error in bdf
{ 0, 0, "b14.bdf", "b14", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b14.bdf", "b14", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b14.bdf", "b14", 16, 0, BM_T, FM_C, MM_M, "japanese3.map", "_japanese3" },
{ 0, 0, "b14_b.bdf", "b14_b", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b14_b.bdf", "b14_b", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b14_b.bdf", "b14_b", 16, 0, BM_T, FM_C, MM_M, "japanese3.map", "_japanese3" },
*/
{ 0, 0, "f12.bdf", "f12", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "f12.bdf", "f12", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "f12_b.bdf", "f12_b", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "f12_b.bdf", "f12_b", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b16.bdf", "b16", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b16.bdf", "b16", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b16.bdf", "b16", 16, 0, BM_T, FM_C, MM_M, "japanese3.map", "_japanese3" },
{ 0, 0, "b16_b.bdf", "b16_b", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "b16_b.bdf", "b16_b", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "b16_b.bdf", "b16_b", 16, 0, BM_T, FM_C, MM_M, "japanese3.map", "_japanese3" },
{ 0, 0, "f16.bdf", "f16", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "f16.bdf", "f16", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "f16_b.bdf", "f16_b", 16, 0, BM_T, FM_C, MM_M, "japanese1.map", "_japanese1" },
{ 0, 0, "f16_b.bdf", "f16_b", 16, 0, BM_T, FM_C, MM_M, "japanese2.map", "_japanese2" },
{ 0, 0, "ArtosSans-8.bdf", "artossans8", 7, 0, BM_8, FM_C|FM_8, MM_R|MM_U|MM_N, "" , ""},
{ 0, 0, "ArtosSerif-8.bdf", "artosserif8", 7, 0, BM_8, FM_C|FM_8, MM_R|MM_U|MM_N, "" , ""},
{ 0, 0, "Chroma48Medium-8.bdf", "chroma48medium8", 7, 0, BM_8, FM_C|FM_8, MM_R|MM_U|MM_N, "" , ""},
/* no lowercase */
{ 0, 0, "SaikyoSansBold-8.bdf", "saikyosansbold8", 7, 0, BM_8, FM_C|FM_8, MM_U|MM_N, "" , ""},
{ 0, 0, "TorusSansBold-8.bdf", "torussansbold8", 7, 0, BM_8, FM_C|FM_8, MM_R|MM_U|MM_N, "" , ""},
{ 0, 0, "VictoriaBold-8.bdf", "victoriabold8", 7, 0, BM_8, FM_C|FM_8, MM_R|MM_U|MM_N, "" , ""},
{ 0, 0, "VictoriaMedium-8.bdf", "victoriamedium8", 7, 0, BM_8, FM_C|FM_8, MM_R|MM_U|MM_N, "" , ""},
{ 0, 0, "courB08.bdf", "courB08", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courB10.bdf", "courB10", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courB12.bdf", "courB12", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courB14.bdf", "courB14", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courB18.bdf", "courB18", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courB24.bdf", "courB24", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courR08.bdf", "courR08", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courR10.bdf", "courR10", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courR12.bdf", "courR12", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courR14.bdf", "courR14", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courR18.bdf", "courR18", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "courR24.bdf", "courR24", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ "-y -1 -th 2 -tv 3", 0, "courB18.bdf", "courB18_2x3", 5, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -1 -th 2 -tv 3", 0, "courR18.bdf", "courR18_2x3", 5, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -2 -th 3 -tv 4", 0, "courB24.bdf", "courB24_3x4", 5, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -2 -th 3 -tv 4", 0, "courR24.bdf", "courR24_3x4", 5, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ 0, 0, "helvB08.bdf", "helvB08", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvB10.bdf", "helvB10", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvB12.bdf", "helvB12", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvB14.bdf", "helvB14", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvB18.bdf", "helvB18", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvB24.bdf", "helvB24", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvR08.bdf", "helvR08", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvR10.bdf", "helvR10", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvR12.bdf", "helvR12", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvR14.bdf", "helvR14", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvR18.bdf", "helvR18", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "helvR24.bdf", "helvR24", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenB08.bdf", "ncenB08", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenB10.bdf", "ncenB10", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenB12.bdf", "ncenB12", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenB14.bdf", "ncenB14", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenB18.bdf", "ncenB18", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenB24.bdf", "ncenB24", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenR08.bdf", "ncenR08", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenR10.bdf", "ncenR10", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenR12.bdf", "ncenR12", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenR14.bdf", "ncenR14", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenR18.bdf", "ncenR18", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "ncenR24.bdf", "ncenR24", 5, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timB08.bdf", "timB08", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timB10.bdf", "timB10", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timB12.bdf", "timB12", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timB14.bdf", "timB14", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timB18.bdf", "timB18", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timB24.bdf", "timB24", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timR08.bdf", "timR08", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timR10.bdf", "timR10", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timR12.bdf", "timR12", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timR14.bdf", "timR14", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timR18.bdf", "timR18", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, 0, "timR24.bdf", "timR24", 5, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
/* Adobe symb skipped... */
{ 0, "-r 72 -p 8", "baby.ttf", "baby", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 8", "blipfest_07.ttf", "blipfest_07", 2, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 8", "chikita.ttf", "chikita", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 8", "lucasfont_alternate.ttf", "lucasfont_alternate",2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 8", "p01type.ttf", "p01type", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 8", "pixelle_micro.ttf", "pixelle_micro", 2, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "robot_de_niro.ttf", "robot_de_niro", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 8", "trixel_square.ttf", "trixel_square", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "haxrcorp4089.ttf", "haxrcorp4089", 2, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "haxrcorp4089.ttf", "haxrcorp4089", 2, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-r 72 -p 24", "bubble.ttf", "bubble", 2, 0, BM_T, FM_C, MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 36", "cardimon-pixel.ttf", "cardimon_pixel", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 32", "maniac.ttf", "maniac", 2, 0, BM_T, FM_C, MM_E|MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 32", "lucasarts-scumm-subtitle-roman-outline.ttf", "lucasarts_scumm_subtitle_o", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-r 72 -p 16", "lucasarts-scumm-subtitle-roman.ttf", "lucasarts_scumm_subtitle_r", 2, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ "-y 1 -th 2 -tv 2", "-r 72 -p 32", "lucasarts-scumm-subtitle-roman-outline.ttf", "lucasarts_scumm_subtitle_o_2x2", 2, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y 0 -th 2 -tv 2", "-r 72 -p 16", "lucasarts-scumm-subtitle-roman.ttf", "lucasarts_scumm_subtitle_r_2x2", 2, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
/*
Free Universal Bold
./do_fontsize_a_v2.sh 16 ../ttf/fu/FreeUniversal-Bold.ttf fub11
./do_fontsize_a_v2.sh 20 ../ttf/fu/FreeUniversal-Bold.ttf fub14
./do_fontsize_a_v2.sh 23 ../ttf/fu/FreeUniversal-Bold.ttf fub17
./do_fontsize_a_v2.sh 27 ../ttf/fu/FreeUniversal-Bold.ttf fub20
./do_fontsize_a_v2.sh 34 ../ttf/fu/FreeUniversal-Bold.ttf fub25
./do_fontsize_a_v2.sh 40 ../ttf/fu/FreeUniversal-Bold.ttf fub30
./do_fontsize_a_v2.sh 49 ../ttf/fu/FreeUniversal-Bold.ttf fub35
./do_fontsize_a_v2.sh 58 ../ttf/fu/FreeUniversal-Bold.ttf fub42
./do_fontsize_a_v2.sh 68 ../ttf/fu/FreeUniversal-Bold.ttf fub49
*/
{ 0, "-a -r 72 -p 16", "FreeUniversal-Bold.ttf", "fub11", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 20", "FreeUniversal-Bold.ttf", "fub14", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 23", "FreeUniversal-Bold.ttf", "fub17", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 27", "FreeUniversal-Bold.ttf", "fub20", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 34", "FreeUniversal-Bold.ttf", "fub25", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 40", "FreeUniversal-Bold.ttf", "fub30", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 49", "FreeUniversal-Bold.ttf", "fub35", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 58", "FreeUniversal-Bold.ttf", "fub42", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 68", "FreeUniversal-Bold.ttf", "fub49", 8, 0, BM_T, FM_C, MM_N, "", "" },
{ 0, "-a -r 72 -p 16", "FreeUniversal-Bold.ttf", "fub11", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 20", "FreeUniversal-Bold.ttf", "fub14", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 23", "FreeUniversal-Bold.ttf", "fub17", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 27", "FreeUniversal-Bold.ttf", "fub20", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 34", "FreeUniversal-Bold.ttf", "fub25", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 40", "FreeUniversal-Bold.ttf", "fub30", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 49", "FreeUniversal-Bold.ttf", "fub35", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 58", "FreeUniversal-Bold.ttf", "fub42", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2031-$3000", "_symbol" }, // per mill sign does not fit
{ 0, "-a -r 72 -p 68", "FreeUniversal-Bold.ttf", "fub49", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2031-$3000", "_symbol" }, // per mill sign does not fit
/*
Free Universal Regular
./do_fontsize_a_v2.sh 15 ../ttf/fu/FreeUniversal-Regular.ttf fur11
./do_fontsize_a_v2.sh 19 ../ttf/fu/FreeUniversal-Regular.ttf fur14
./do_fontsize_a_v2.sh 23 ../ttf/fu/FreeUniversal-Regular.ttf fur17
./do_fontsize_a_v2.sh 28 ../ttf/fu/FreeUniversal-Regular.ttf fur20
./do_fontsize_a_v2.sh 34 ../ttf/fu/FreeUniversal-Regular.ttf fur25
./do_fontsize_a_v2.sh 40 ../ttf/fu/FreeUniversal-Regular.ttf fur30
./do_fontsize_a_v2.sh 48 ../ttf/fu/FreeUniversal-Regular.ttf fur35
./do_fontsize_a_v2.sh 58 ../ttf/fu/FreeUniversal-Regular.ttf fur42
./do_fontsize_a_v2.sh 68 ../ttf/fu/FreeUniversal-Regular.ttf fur49
*/
{ 0, "-a -r 72 -p 15", "FreeUniversal-Regular.ttf", "fur11", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 19", "FreeUniversal-Regular.ttf", "fur14", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 23", "FreeUniversal-Regular.ttf", "fur17", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 28", "FreeUniversal-Regular.ttf", "fur20", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 34", "FreeUniversal-Regular.ttf", "fur25", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 40", "FreeUniversal-Regular.ttf", "fur30", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 48", "FreeUniversal-Regular.ttf", "fur35", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 58", "FreeUniversal-Regular.ttf", "fur42", 8, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 68", "FreeUniversal-Regular.ttf", "fur49", 8, 0, BM_T, FM_C, MM_N, "", "" },
{ 0, "-a -r 72 -p 16", "FreeUniversal-Regular.ttf", "fur11", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 19", "FreeUniversal-Regular.ttf", "fur14", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 23", "FreeUniversal-Regular.ttf", "fur17", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 28", "FreeUniversal-Regular.ttf", "fur20", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 34", "FreeUniversal-Regular.ttf", "fur25", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 40", "FreeUniversal-Regular.ttf", "fur30", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 48", "FreeUniversal-Regular.ttf", "fur35", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2030-$3000", "_symbol" },
{ 0, "-a -r 72 -p 58", "FreeUniversal-Regular.ttf", "fur42", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2031-$3000", "_symbol" }, // per mill sign does not fit
{ 0, "-a -r 72 -p 68", "FreeUniversal-Regular.ttf", "fur49", 8, 0, BM_T, FM_C, MM_C, "32,35-57,$300-$3ff,$2031-$3000", "_symbol" }, // per mill sign does not fit
/*
./do_fontsize_a_v2.sh 25 ../ttf/os/OldStandard-Bold.ttf osb18
./do_fontsize_a_v2.sh 28 ../ttf/os/OldStandard-Bold.ttf osb21
./do_fontsize_a_v2.sh 34 ../ttf/os/OldStandard-Bold.ttf osb26
./do_fontsize_a_v2.sh 38 ../ttf/os/OldStandard-Bold.ttf osb29
./do_fontsize_a_v2.sh 48 ../ttf/os/OldStandard-Bold.ttf osb35
./do_fontsize_a_v2.sh 55 ../ttf/os/OldStandard-Bold.ttf osb41
*/
/*
bugfix 14 Jul 2017, this is the old (and wrong) code:
{ 0, "-a -r 72 -p 25", "OldStandard-Regular.ttf", "osb18", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 28", "OldStandard-Regular.ttf", "osb21", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 34", "OldStandard-Regular.ttf", "osb26", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 38", "OldStandard-Regular.ttf", "osb29", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 48", "OldStandard-Regular.ttf", "osb35", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 55", "OldStandard-Regular.ttf", "osb41", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
*/
{ 0, "-a -r 72 -p 25", "OldStandard-Bold.ttf", "osb18", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 28", "OldStandard-Bold.ttf", "osb21", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 34", "OldStandard-Bold.ttf", "osb26", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 38", "OldStandard-Bold.ttf", "osb29", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 48", "OldStandard-Bold.ttf", "osb35", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 55", "OldStandard-Bold.ttf", "osb41", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
/*
./do_fontsize_a_v2.sh 26 ../ttf/os/OldStandard-Regular.ttf osr18
./do_fontsize_a_v2.sh 29 ../ttf/os/OldStandard-Regular.ttf osr21
./do_fontsize_a_v2.sh 36 ../ttf/os/OldStandard-Regular.ttf osr26
./do_fontsize_a_v2.sh 41 ../ttf/os/OldStandard-Regular.ttf osr29
./do_fontsize_a_v2.sh 49 ../ttf/os/OldStandard-Regular.ttf osr35
./do_fontsize_a_v2.sh 57 ../ttf/os/OldStandard-Regular.ttf osr41
*/
{ 0, "-a -r 72 -p 26", "OldStandard-Regular.ttf", "osr18", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 29", "OldStandard-Regular.ttf", "osr21", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 36", "OldStandard-Regular.ttf", "osr26", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 41", "OldStandard-Regular.ttf", "osr29", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 49", "OldStandard-Regular.ttf", "osr35", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 57", "OldStandard-Regular.ttf", "osr41", 9, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
/*
inconsolata
./do_fontsize_a_mono_v2.sh 22 ../ttf/in/inr.otf inr16
./do_fontsize_a_mono_v2.sh 26 ../ttf/in/inr.otf inr19
./do_fontsize_a_mono_v2.sh 30 ../ttf/in/inr.otf inr21
./do_fontsize_a_mono_v2.sh 33 ../ttf/in/inr.otf inr24
./do_fontsize_a_mono_v2.sh 36 ../ttf/in/inr.otf inr27
./do_fontsize_a_mono_v2.sh 40 ../ttf/in/inr.otf inr30
./do_fontsize_a_mono_v2.sh 44 ../ttf/in/inr.otf inr33
./do_fontsize_a_mono_v2.sh 51 ../ttf/in/inr.otf inr38
./do_fontsize_a_mono_v2.sh 57 ../ttf/in/inr.otf inr42
./do_fontsize_a_mono_v2.sh 62 ../ttf/in/inr.otf inr46
./do_fontsize_a_mono_v2.sh 67 ../ttf/in/inr.otf inr49
./do_fontsize_a_mono_v2.sh 72 ../ttf/in/inr.otf inr53
./do_fontsize_a_mono_v2.sh 78 ../ttf/in/inr.otf inr57
./do_fontsize_a_mono_v2.sh 82 ../ttf/in/inr.otf inr62
*/
{ 0, "-a -r 72 -p 22", "inr.otf", "inr16", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 26", "inr.otf", "inr19", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 30", "inr.otf", "inr21", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 33", "inr.otf", "inr24", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 33", "inr.otf", "inr24", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 36", "inr.otf", "inr27", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 36", "inr.otf", "inr27", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 40", "inr.otf", "inr30", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 40", "inr.otf", "inr30", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 44", "inr.otf", "inr33", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 44", "inr.otf", "inr33", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 51", "inr.otf", "inr38", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 51", "inr.otf", "inr38", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 57", "inr.otf", "inr42", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 57", "inr.otf", "inr42", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 62", "inr.otf", "inr46", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 62", "inr.otf", "inr46", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 67", "inr.otf", "inr49", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 67", "inr.otf", "inr49", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 72", "inr.otf", "inr53", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 72", "inr.otf", "inr53", 11, 0, BM_T, FM_C, MM_C, "32-128,$400-$52f", "_cyrillic" },
{ 0, "-a -r 72 -p 78", "inr.otf", "inr57", 11, 0, BM_M, FM_C, MM_N, "", "" },
{ 0, "-a -r 72 -p 82", "inr.otf", "inr62", 11, 0, BM_M, FM_C, MM_N, "", "" },
{ "-y -1 -x 1 -th 2 -tv 4", "-a -r 72 -p 30", "inr.otf", "inr21_2x4", 11, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -1 -x 2 -th 3 -tv 6", "-a -r 72 -p 44", "inr.otf", "inr33_3x6", 11, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y 0 -x 3 -th 4 -tv 8", "-a -r 72 -p 62", "inr.otf", "inr46_4x8", 11, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
/*
./do_fontsize_a_mono_v2.sh 22 ../ttf/in/inb.otf inb16
./do_fontsize_a_mono_v2.sh 25 ../ttf/in/inb.otf inb19
./do_fontsize_a_mono_v2.sh 30 ../ttf/in/inb.otf inb21
./do_fontsize_a_mono_v2.sh 33 ../ttf/in/inb.otf inb24
./do_fontsize_a_mono_v2.sh 36 ../ttf/in/inb.otf inb27
./do_fontsize_a_mono_v2.sh 40 ../ttf/in/inb.otf inb30
./do_fontsize_a_mono_v2.sh 44 ../ttf/in/inb.otf inb33
./do_fontsize_a_mono_v2.sh 51 ../ttf/in/inb.otf inb38
./do_fontsize_a_mono_v2.sh 57 ../ttf/in/inb.otf inb42
./do_fontsize_a_mono_v2.sh 62 ../ttf/in/inb.otf inb46
./do_fontsize_a_mono_v2.sh 66 ../ttf/in/inb.otf inb49
./do_fontsize_a_mono_v2.sh 71 ../ttf/in/inb.otf inb53
./do_fontsize_a_mono_v2.sh 78 ../ttf/in/inb.otf inb57
./do_fontsize_a_mono_v2.sh 84 ../ttf/in/inb.otf inb63
*/
{ 0, "-a -r 72 -p 22", "inb.otf", "inb16", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 25", "inb.otf", "inb19", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 30", "inb.otf", "inb21", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 33", "inb.otf", "inb24", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 36", "inb.otf", "inb27", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 40", "inb.otf", "inb30", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 44", "inb.otf", "inb33", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 51", "inb.otf", "inb38", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 57", "inb.otf", "inb42", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 62", "inb.otf", "inb46", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 66", "inb.otf", "inb49", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 71", "inb.otf", "inb53", 11, 0, BM_M, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 78", "inb.otf", "inb57", 11, 0, BM_M, FM_C, MM_N, "", "" },
{ 0, "-a -r 72 -p 84", "inb.otf", "inb63", 11, 0, BM_M, FM_C, MM_N, "", "" },
{ "-y -1 -x 1 -th 2 -tv 4", "-a -r 72 -p 30", "inb.otf", "inb21_2x4", 11, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -1 -x 2 -th 3 -tv 6", "-a -r 72 -p 44", "inb.otf", "inb33_3x6", 11, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y 0 -x 3 -th 4 -tv 8", "-a -r 72 -p 62", "inb.otf", "inb46_4x8", 11, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
/*
Logisoso
./do_fontsize_a_v2.sh 23 ../ttf/log/Logisoso.ttf logisoso16
./do_fontsize_a_v2.sh 27 ../ttf/log/Logisoso.ttf logisoso18
./do_fontsize_a_v2.sh 30 ../ttf/log/Logisoso.ttf logisoso20
./do_fontsize_a_v2.sh 32 ../ttf/log/Logisoso.ttf logisoso22
./do_fontsize_a_v2.sh 34 ../ttf/log/Logisoso.ttf logisoso24
./do_fontsize_a_v2.sh 38 ../ttf/log/Logisoso.ttf logisoso26
./do_fontsize_a_v2.sh 40 ../ttf/log/Logisoso.ttf logisoso28
./do_fontsize_a_no_64_v2.sh 43 ../ttf/log/Logisoso.ttf logisoso30
./do_fontsize_a_no_64_v2.sh 45 ../ttf/log/Logisoso.ttf logisoso32
./do_fontsize_a_no_64_v2.sh 49 ../ttf/log/Logisoso.ttf logisoso34
./do_fontsize_a_no_64_v2.sh 54 ../ttf/log/Logisoso.ttf logisoso38
./do_fontsize_a_no_64_v2.sh 60 ../ttf/log/Logisoso.ttf logisoso42
./do_fontsize_a_no_64_v2.sh 66 ../ttf/log/Logisoso.ttf logisoso46
./do_fontsize_a_no_64_v2.sh 71 ../ttf/log/Logisoso.ttf logisoso50
./do_fontsize_a_no_64_v2.sh 77 ../ttf/log/Logisoso.ttf logisoso54
./do_fontsize_a_no_64_v2.sh 83 ../ttf/log/Logisoso.ttf logisoso58
./do_fontsize_a_no_64_v2.sh 89 ../ttf/log/Logisoso.ttf logisoso62
*/
{ 0, "-a -r 72 -p 23", "Logisoso.ttf", "logisoso16", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 27", "Logisoso.ttf", "logisoso18", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 30", "Logisoso.ttf", "logisoso20", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 32", "Logisoso.ttf", "logisoso22", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 34", "Logisoso.ttf", "logisoso24", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 38", "Logisoso.ttf", "logisoso26", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 40", "Logisoso.ttf", "logisoso28", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 43", "Logisoso.ttf", "logisoso30", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 45", "Logisoso.ttf", "logisoso32", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 49", "Logisoso.ttf", "logisoso34", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 54", "Logisoso.ttf", "logisoso38", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 60", "Logisoso.ttf", "logisoso42", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 66", "Logisoso.ttf", "logisoso46", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 71", "Logisoso.ttf", "logisoso50", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 77", "Logisoso.ttf", "logisoso54", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 83", "Logisoso.ttf", "logisoso58", 10, 0, BM_T, FM_C, MM_F|MM_R|MM_N, "", "" },
{ 0, "-a -r 72 -p 89", "Logisoso.ttf", "logisoso62", 10, 0, BM_T, FM_C, MM_N, "", "" },
{ 0, "-a -r 72 -p 110", "Logisoso.ttf", "logisoso78", 10, 0, BM_T, FM_C, MM_N, "", "" },
{ 0, "-a -r 72 -p 131", "Logisoso.ttf", "logisoso92", 10, 0, BM_T, FM_C, MM_N, "", "" },
{ 0, "-r 72 -p 8", "PressStart2P.ttf", "pressstart2p", 12, 0, BM_8, FM_C|FM_8, MM_F|MM_R|MM_U|MM_N, "" , ""},
{ 0, "-r 72 -p 8", "pcsenior.ttf", "pcsenior", 12, 0, BM_8, FM_C|FM_8, MM_F|MM_R|MM_U|MM_N, "" , ""},
/*
PxPlus_IBM_CGAthin.ttf
PxPlus_IBM_CGA.ttf
PxPlus_TandyNew_TV.ttf
*/
{ 0, "-r 72 -p 8", "PxPlus_IBM_CGAthin.ttf", "pxplusibmcgathin", 14, 0, BM_8, FM_C|FM_8, MM_F|MM_R|MM_U|MM_N, "" , ""},
{ 0, "-r 72 -p 8", "PxPlus_IBM_CGA.ttf", "pxplusibmcga", 14, 0, BM_8, FM_C|FM_8, MM_F|MM_R|MM_U|MM_N, "" , ""},
{ 0, "-r 72 -p 8", "PxPlus_TandyNew_TV.ttf", "pxplustandynewtv", 14, 0, BM_8, FM_C|FM_8, MM_F|MM_R|MM_U|MM_N, "" , ""},
{ 0, "-r 72 -p 8", "PxPlus_TandyNew_TV.ttf", "pxplustandynewtv", 14, 0, BM_T|BM_8, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "PxPlus_IBM_VGA9.ttf", "pxplusibmvga9", 14, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "" , ""},
{ 0, "-r 72 -p 16", "PxPlus_IBM_VGA9.ttf", "pxplusibmvga9", 14, 0, BM_T|BM_M, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "PxPlus_IBM_VGA8.ttf", "pxplusibmvga8", 14, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "" , ""},
{ 0, "-r 72 -p 16", "PxPlus_IBM_VGA8.ttf", "pxplusibmvga8", 14, 0, BM_T|BM_M, FM_C, MM_C, "32-$ffff", "_all" },
{ 0, "-r 72 -p 16", "Px437_Wyse700a.ttf", "px437wyse700a", 14, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "" , ""},
{ 0, "-r 72 -p 16", "Px437_Wyse700b.ttf", "px437wyse700b", 14, 0, BM_T|BM_M, FM_C, MM_F|MM_R|MM_N, "" , ""},
//#endif /* TMP */
{ "-y -1 -th 2 -tv 2", "-r 72 -p 16", "Px437_Wyse700a.ttf", "px437wyse700a_2x2", 14, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
{ "-y -1 -th 2 -tv 2", "-r 72 -p 16", "Px437_Wyse700b.ttf", "px437wyse700b_2x2", 14, 0, BM_8, FM_8, MM_F|MM_R|MM_N, "" , ""},
};
char *bdf_path = "../bdf/";
char *bdfconv_path = "../bdfconv/bdfconv";
char *otf2bdf_path = "../otf2bdf/otf2bdf";
FILE *u8g2_font_list_fp;
FILE *u8x8_font_list_fp;
FILE *keywords_fp;
char *u8g2_prototypes = NULL;
char *u8x8_prototypes = NULL;
char *u8g2_fonts_filename = "../../../csrc/u8g2_fonts.c";
char *u8x8_fonts_filename = "../../../csrc/u8x8_fonts.c";
char target_font_identifier[1024];
char otf_cmd[2048];
char bdf_cmd[2048];
char font_prototype[2048];
char tga_filename[2048];
char convert_cmd[2048];
int current_font_group_index;
char current_font_name[256] = "";
FILE *current_md_file;
int current_capital_A_size;
const char *fntlistallpath = "../../../../u8g2.wiki/fntlistall.md";
FILE *fntlistall;
const char *fntlistmonopath = "../../../../u8g2.wiki/fntlistmono.md";
FILE *fntlistmono;
const char *fntlist8x8path = "../../../../u8g2.wiki/fntlist8x8.md";
FILE *fntlist8x8;
#ifdef BUILD2
u8g2_t u8g2;
int u8x8_fnt_cnt = 0;
int u8g2_fnt_cnt = 0;
extern void do_font_loop(cbfn_t cb);
/*===================================================================*/
/* word cloud */
#define WORD_CLOUD_MAX_X 600
struct _box_t
{
uint32_t w, h;
};
typedef struct _box_t box_t;
struct _pos_t
{
uint32_t x, y;
};
typedef struct _pos_t pos_t;
struct _pbox_t // placed box
{
pos_t pos;
int box_idx;
};
typedef struct _pbox_t pbox_t;
#define BOX_LIST_MAX 500
box_t box_list[BOX_LIST_MAX];
char box_word[BOX_LIST_MAX][64];
const uint8_t *box_font[BOX_LIST_MAX];
int box_cnt = 0;
int box_index[BOX_LIST_MAX];
#define PLACE_OPTION_MAX 1000
int place_option_cnt = 0;
pos_t place_option_list[PLACE_OPTION_MAX];
#define PLACED_BOX_MAX 1000
int placed_box_cnt = 0;
pbox_t placed_box_list[PLACED_BOX_MAX];
uint32_t placed_box_area_max_x;
uint32_t placed_box_area_max_y;
uint32_t placed_box_area_value;
/*============================================*/
int place_option_find(pos_t *p)
{
int i;
for( i = 0; i < place_option_cnt; i++ )
{
if ( place_option_list[i].x == p->x && place_option_list[i].y == p->y)
return i; // place option already exists
}
return -1;
}
void place_option_add(pos_t *p)
{
int i;
assert(place_option_cnt < PLACE_OPTION_MAX);
if ( place_option_find(p) >= 0 )
return; // place option already exists
// the placement option also must not be part of any existing box
for( i = 2; i < placed_box_cnt; i++ )
{
if ( p->x >= placed_box_list[i].pos.x && p->x < placed_box_list[i].pos.x + box_list[placed_box_list[i].box_idx].w )
if ( p->y >= placed_box_list[i].pos.y && p->y < placed_box_list[i].pos.y + box_list[placed_box_list[i].box_idx].h )
return; // place option would be inside an existing box
}
// place option does not exist, add new place option
place_option_list[place_option_cnt] = *p;
place_option_cnt++;
}
void place_option_by_xy(uint32_t x, uint32_t y)
{
pos_t p;
p.x = x;
p.y = y;
place_option_add(&p);
}
void place_option_delete(int idx)
{
if ( idx < 0 || idx >= place_option_cnt )
return;
for( ; idx+1 < place_option_cnt; idx++ )
{
place_option_list[idx] = place_option_list[idx+1];
}
place_option_cnt--;
}
/*============================================*/
// p is copyied, b only the address is stored
pbox_t *placed_box_push(pos_t *p, int box_idx)
{
assert(placed_box_cnt < PLACED_BOX_MAX);
// place the new box
placed_box_list[placed_box_cnt].pos = *p;
placed_box_list[placed_box_cnt].box_idx = box_idx;
placed_box_cnt++;
return placed_box_list+placed_box_cnt-1;
}
void placed_box_pop(void)
{
assert(placed_box_cnt > 0);
placed_box_cnt--;
}
uint32_t placed_box_calculate_max_area(void)
{
int i;
placed_box_area_max_y = 0;
placed_box_area_max_x = 0;
for( i = 2; i < placed_box_cnt; i++ )
{
if ( placed_box_area_max_y < placed_box_list[i].pos.y + box_list[placed_box_list[i].box_idx].h )
placed_box_area_max_y = placed_box_list[i].pos.y + box_list[placed_box_list[i].box_idx].h;
if ( placed_box_area_max_x < placed_box_list[i].pos.x + box_list[placed_box_list[i].box_idx].w )
placed_box_area_max_x = placed_box_list[i].pos.x + box_list[placed_box_list[i].box_idx].w;
}
if ( placed_box_area_max_x > WORD_CLOUD_MAX_X )
// weight of y is higher, so this should give a more wider picture
placed_box_area_value = placed_box_area_max_x*5 + placed_box_area_max_y ;
else
// weight of y is higher, so this should give a more wider picture
placed_box_area_value = placed_box_area_max_x + placed_box_area_max_y *5;
return placed_box_area_value;
}
/*============================================*/
int is_intersection(pos_t *p1, box_t *b1, pos_t *p2, box_t *b2)
{
pos_t q1 = *p1;
pos_t q2 = *p2;
q1.x += b1->w;
q1.y += b1->h;
q2.x += b2->w;
q2.y += b2->h;
if ( p1->x >= q2.x || q1.x <= p2->x )
return 0;
if ( p1->y >= q2.y || q1.y <= p2->y )
return 0;
return 1;
}
int is_intersection_with_placed_box(pos_t *p1, box_t *b1, int idx)
{
return is_intersection(p1, b1, &(placed_box_list[idx].pos), box_list+placed_box_list[idx].box_idx );
}
int is_any_intersection(pos_t *p1, box_t *b1)
{
int i;
// start with the third box, because the first two are boundary boxes
for( i = 2; i < placed_box_cnt; i++ )
{
if ( is_intersection_with_placed_box(p1, b1, i) != 0 )
return 1;
}
return 0;
}
// add new place options by a give pbox
void place_option_by_pbox(pbox_t *pbox)
{
int i, found_i;
uint32_t y, x;
uint32_t max_y, max_x;
// from the lower left corner, search towards the left until another box is hit.
y = pbox->pos.y + box_list[pbox->box_idx].h;
max_x = 0;
found_i = -1;
for( i = 0; i < placed_box_cnt; i++ )
{
if ( placed_box_list+i != pbox ) // do not check ourself
{
if ( placed_box_list[i].pos.x <= pbox->pos.x )
{
if ( y >= placed_box_list[i].pos.y && y < placed_box_list[i].pos.y + box_list[placed_box_list[i].box_idx].h )
{
// left box found, but is it max?
// must use >= here, because the initial boxes have zero area
if ( max_x <= placed_box_list[i].pos.x + box_list[placed_box_list[i].box_idx].w )
{
max_x = placed_box_list[i].pos.x + box_list[placed_box_list[i].box_idx].w;
found_i = i;
}
}
}
}
}
if (found_i >= 0)
place_option_by_xy(max_x, y);
// from the upper right corner, search towards the top until another box is hit.
x = pbox->pos.x + box_list[pbox->box_idx].w;
max_y = 0;
found_i = -1;
for( i = 0; i < placed_box_cnt; i++ )
{
if ( placed_box_list+i != pbox ) // do not check ourself
{
if ( placed_box_list[i].pos.y <= pbox->pos.y )
{
if ( x >= placed_box_list[i].pos.x && x < placed_box_list[i].pos.x + box_list[placed_box_list[i].box_idx].w )
{
// upper box found, but is it the next ?
// must use >= here, because the initial boxes have zero area
if ( max_y <= placed_box_list[i].pos.y + box_list[placed_box_list[i].box_idx].h )
{
max_y = placed_box_list[i].pos.y + box_list[placed_box_list[i].box_idx].h;
found_i = i;
}
}
}
}
}
if (found_i >= 0)
place_option_by_xy(x, max_y);
}
void add_all_place_options(void)
{
int i;
//place_option_cnt = 0; // clear the place option list
for( i = 2; i < placed_box_cnt; i++ )
{
place_option_by_pbox(placed_box_list+i);
}
}
void show(void)
{
pos_t p;
box_t b;
int i;
b.w = 1;
b.h = 1;
for( p.y = 0; p.y < 30; p.y++ )
{
for( p.x = 0; p.x < 60; p.x++ )
{
for( i = 0; i < place_option_cnt; i++ )
{
if ( place_option_list[i].x == p.x && place_option_list[i].y == p.y )
{
break;
}
}
if ( i < place_option_cnt )
{
printf("*");
}
else
{
for( i = 0; i < placed_box_cnt; i++ )
{
if ( is_intersection_with_placed_box(&p, &b, i) != 0 )
break;
}
if ( i < placed_box_cnt )
{
printf("%c", i+'a');
}
else
{
printf(" ");
}
}
}
printf("\n");
}
}
void init(void)
{
pos_t p;
box_list[0].w = 0x0ffffffff;
box_list[0].h = 0;
box_list[1].w = 0;
box_list[1].h = 0x0ffffffff;
box_cnt = 2;
place_option_cnt = 0;
placed_box_cnt = 0;
p.x = 0;
p.y = 0;
placed_box_push(&p, 0);
p.x = 0;
p.y = 0;
placed_box_push(&p, 1);
// create one place option at the upper left
place_option_by_xy(0, 0);
}
void do_best_place(int box_idx)
{
int i;
int found_i;
pbox_t *pbox;
uint32_t value;
uint32_t lowest_value;
found_i = -1;
lowest_value = 0x0ffffffff;
for( i = 0; i < place_option_cnt; i++ )
{
// check whether this placement would generate an intersection
if ( is_any_intersection(place_option_list+i, box_list+box_idx) == 0 )
{
// place the box at the position
pbox = placed_box_push(place_option_list+i, box_idx);
value = placed_box_calculate_max_area();
/*
if ( value == 0x0ffffffff )
{
value = pbox->pos.y;
}
else
*/
{
value *= 8;
value += pbox->pos.x;
value += pbox->pos.y;
}
// greedy algorithm: We search for the lowest area increase
if ( lowest_value > value )
{
lowest_value = value ;
found_i = i;
}
placed_box_pop();
}
}
if ( found_i >= 0 )
{
// now permanently place the box
pbox = placed_box_push(place_option_list+found_i, box_idx);
// delete the position from the place option list
place_option_delete(found_i);
// calculate new place options with the new box
//place_option_by_pbox(pbox);
// recalculate all place options
add_all_place_options();
}
else
{
//assert(found_i >= 0 );
}
}
/*
Linear Congruential Generator (LCG)
z = (a*z + c) % m;
m = 256 (8 Bit)
for period:
a-1: dividable by 2
a-1: multiple of 4
c: not dividable by 2
c = 17
a-1 = 64 --> a = 65
*/
uint8_t cloud_z = 127; // start value
uint8_t cloud_rnd(void) {
/*
cloud_z++;
cloud_z = (uint8_t)((uint16_t)65*(uint16_t)cloud_z + (uint16_t)17);
return (uint8_t)cloud_z;
*/
return rand() & 255;
}
//u8g2_IsAllValidUTF8
char *cloud_utf8[] =
{
"µC"
"Numérique"
"像素",
"屏幕",
"图形",
"Ψηφιακή",
"Οθόνη",
"Γραφικά",
"アイコン、",
"ビットマップ",
"キャラクター、",
"전자", "엔지니어", "장치", "하드웨어",
"Ingeniør", "Skærm",
"Gerät",
"Sprzęt",
"Računar", "Ugrađen",
"Grafică",
"экран",
"Графика",
"Значок",
"Фонт", "екран", "рачунар", "уграђен",
"พิกเซล",
"หน้าจอ",
"กราฟิก",
"Näyttö",
"ĂăĚěŇň",
"ÄäÖöÜü",
"Ææ",
"E=mc²",
"Pixel",
"Screen",
"Graphics",
"Icon",
"Bitmap",
"Character",
"Glyph",
"Font",
"Display",
"Computer",
"Embedded",
"Electronics",
"Engineer",
"Device",
"Hardware",
"Software",
"Science",
"Digital",
"Arduino",
"U8g2"
};
char *cloud_str[] =
{
"Pixel",
"Screen",
"Graphics",
"Icon",
"Bitmap",
"Character",
"Glyph",
"Font",
"Display",
"Computer",
"Embedded",
"Electronics",
"Engineer",
"Device",
"Hardware",
"Software",
"Science",
"Digital",
"Arduino",
"U8g2"
};
char *cloud_simple[] =
{
"U8g2",
"Abc",
"XYZ",
"Aa",
"Xy"
};
void cloud_add(u8g2_t *u8g2, const uint8_t *font, char *word)
{
u8g2_uint_t extra = 8;
u8g2_SetFont(u8g2, font);
box_list[box_cnt].w = u8g2_GetUTF8Width(u8g2, word) + extra;
box_list[box_cnt].h = u8g2_GetAscent(u8g2) - u8g2_GetDescent(u8g2) + extra;
strcpy(box_word[box_cnt], word);
//puts(word);
box_font[box_cnt] = font;
box_cnt++;
}
void cloud_auto_add(u8g2_t *u8g2, const uint8_t *font)
{
int i, n, cnt;
u8g2_SetFont(u8g2, font);
if ( u8g2_GetAscent(u8g2) - u8g2_GetDescent(u8g2) > 30 )
{
n = sizeof(cloud_simple)/sizeof(*cloud_simple);
cnt = 0;
for( i = 0; i < n; i++ )
{
if ( u8g2_IsAllValidUTF8(u8g2, cloud_simple[i]) != 0 )
{
cnt++;
}
}
if ( cnt > 0 )
{
cnt = cloud_rnd() % cnt;
for( i = 0; i < n; i++ )
{
if ( u8g2_IsAllValidUTF8(u8g2, cloud_simple[i]) != 0 )
{
if ( cnt == 0 )
break;
cnt--;
}
}
}
if ( i < n )
{
cloud_add(u8g2, font, cloud_simple[i]);
return;
}
}
n = sizeof(cloud_utf8)/sizeof(*cloud_utf8);
//printf("n=%d\n", n);
cnt = 0;
for( i = 0; i < n; i++ )
{
if ( u8g2_IsAllValidUTF8(u8g2, cloud_utf8[i]) != 0 )
{
cnt++;
}
}
if ( cnt > 0 )
{
cnt = cloud_rnd() % cnt;
for( i = 0; i < n; i++ )
{
if ( u8g2_IsAllValidUTF8(u8g2, cloud_utf8[i]) != 0 )
{
if ( cnt == 0 )
break;
cnt--;
}
}
}
else
{
i = n;
}
if ( i < n )
{
cloud_add(u8g2, font, cloud_utf8[i]);
return;
}
n = sizeof(cloud_str)/sizeof(*cloud_str);
//printf("n=%d\n", n);
i = cloud_rnd() % n;
cloud_add(u8g2, font, cloud_str[i]);
}
void cloud_init(void)
{
init();
}
void cloud_calculate(uint8_t z)
{
int i;
int a, b, t;
cloud_z = z;
srand(z);
for( i = 0; i < box_cnt; i++ )
{
box_index[i] = i;
}
for ( i = 0; i < box_cnt / 2; i++ )
{
a = cloud_rnd() % (box_cnt-2);
a += 2;
b = cloud_rnd() % (box_cnt-2);
b += 2;
t = box_index[a];
box_index[a] = box_index[b];
box_index[b] = t;
}
for( i = 2; i < box_cnt; i++ )
do_best_place(box_index[i]);
}
void cloud_draw(u8g2_t *u8g2)
{
int i;
for( i = 2; i < placed_box_cnt; i++ )
{
u8g2_SetFont(u8g2, box_font[placed_box_list[i].box_idx]);
u8g2_SetFontMode(u8g2, 1);
u8g2_DrawUTF8(u8g2,
placed_box_list[i].pos.x,
placed_box_list[i].pos.y,
box_word[placed_box_list[i].box_idx]);
}
}
/*===================================================================*/
void overview_draw_line(int i, uint16_t encoding_start, uint16_t x, uint16_t y, uint16_t w, uint16_t glyphs_per_line)
{
int j;
u8g2_SetFont(&u8g2, u8g2_font_list[u8g2_fnt_cnt]);
u8g2_SetFontDirection(&u8g2, 0);
for( j = 0; j < glyphs_per_line; j++)
{
if ( u8g2_IsGlyph(&u8g2, encoding_start + j) != 0 )
{
u8g2_DrawGlyph(&u8g2, x+j*w, y, encoding_start + j);
}
}
}
int is_overview_line_empty(uint16_t encoding_start)
{
int j;
for( j = 0; j < 16; j++)
{
if ( u8g2_IsGlyph(&u8g2, encoding_start + j) != 0 )
{
return 0;
}
}
return 1;
}
void overview_draw_table(int i, uint16_t x, uint16_t y)
{
int cw, ch;
int line, h;
uint16_t encoding;
uint16_t glyphs_per_line = 16;
int size;
static char s[256];
h = 13;
u8g2_SetFont(&u8g2, u8g2_font_list[u8g2_fnt_cnt]);
u8g2_SetFontDirection(&u8g2, 0);
u8g2_SetFontMode(&u8g2, 1);
ch = u8g2_GetMaxCharHeight(&u8g2);
cw = u8g2_GetMaxCharWidth(&u8g2);
sprintf(s, "BBX Width %d, Height %d, Capital A %d",
u8g2_GetMaxCharWidth(&u8g2),
u8g2_GetMaxCharHeight(&u8g2),
u8g2_GetAscent(&u8g2));
u8g2_SetFont(&u8g2, u8g2_font_7x13_tr);
u8g2_DrawStr(&u8g2, 0, h, u8g2_font_names[u8g2_fnt_cnt]);
u8g2_DrawStr(&u8g2, 0, h*2, s);
size = u8g2_GetFontSize(u8g2_font_list[u8g2_fnt_cnt]);
if ( size > 100000 )
glyphs_per_line = 32;
sprintf(s, "Font Data Size: %d Bytes", size);
u8g2_DrawStr(&u8g2, 0, h*3, s);
u8g2_SetFont(&u8g2, u8g2_font_list[u8g2_fnt_cnt]);
u8g2_SetFontDirection(&u8g2, 0);
ch = u8g2_GetMaxCharHeight(&u8g2);
cw = u8g2_GetMaxCharWidth(&u8g2);
if ( ch < h )
ch = h;
y = h*3+ch+1;
line = 0;
for(;;)
{
encoding = line*glyphs_per_line;
if ( is_overview_line_empty(encoding) == 0 )
{
u8g2_SetFont(&u8g2, u8g2_font_7x13_tr);
sprintf(s, "%5d/%04x ", encoding, encoding);
x = u8g2_DrawStr(&u8g2, 0, y, s);
overview_draw_line(i, encoding, x, y, cw+1, glyphs_per_line);
y += ch;
}
line++;
if ( line > 0xfff )
break;
}
if ( u8g2_IsGlyph(&u8g2, 'A') != 0 && u8g2_IsGlyph(&u8g2, 'z') != 0 )
{
y++;
// y -= ch;
u8g2_SetFont(&u8g2, u8g2_font_list[u8g2_fnt_cnt]);
u8g2_SetFontDirection(&u8g2, 0);
//y += u8g2_GetMaxCharHeight(&u8g2);
u8g2_DrawStr(&u8g2, 0, y, "The quick brown fox");
y += u8g2_GetMaxCharHeight(&u8g2);
u8g2_DrawStr(&u8g2, 0, y, "jumps over the lazy dog.");
}
//u8g2_DrawStr(&u8g2, 0, y, "Woven silk pyjamas exchanged for blue quartz");
}
void overviewpic(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
int cw, ch;
if ( fm == FM_8 )
{
int cw;
int ch;
printf("8x8 font overview picture %s\n", target_font_identifier);
u8g2_SetupBuffer_TGA(&u8g2, &u8g2_cb_r0);
u8x8_InitDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetPowerSave(u8g2_GetU8x8(&u8g2), 0);
//u8x8_ClearDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetFont(u8g2_GetU8x8(&u8g2), u8x8_font_amstrad_cpc_extended_r);
u8x8_DrawString(u8g2_GetU8x8(&u8g2), 0, 0, target_font_identifier);
u8x8_SetFont(u8g2_GetU8x8(&u8g2), u8x8_font_list[u8x8_fnt_cnt]);
cw = u8x8_GetFontCharWidth(u8g2_GetU8x8(&u8g2));
ch = u8x8_GetFontCharHeight(u8g2_GetU8x8(&u8g2));
{
uint8_t x;
uint8_t y;
static char s[32];
for( y = 0; y < 16; y++ )
{
u8x8_SetFont(u8g2_GetU8x8(&u8g2), u8x8_font_amstrad_cpc_extended_r);
sprintf(s, "%3d/%02x ", y*16, y*16);
u8x8_DrawString(u8g2_GetU8x8(&u8g2), 0, (y+2)*ch, s);
u8x8_SetFont(u8g2_GetU8x8(&u8g2), u8x8_font_list[u8x8_fnt_cnt]);
for( x = 0; x < 16; x++ )
{
u8x8_DrawGlyph(u8g2_GetU8x8(&u8g2), x*(cw+1)+7,(y+2)*ch, y*16+x);
}
}
}
if ( mm != MM_N )
u8x8_DrawString(u8g2_GetU8x8(&u8g2), 0,(16+2)*ch, "The quick brown fox jumps over the lazy dog.");
tga_save("font.tga");
sprintf(convert_cmd, "convert font.tga -trim %s.png", target_font_identifier );
system(convert_cmd);
u8x8_fnt_cnt++;
}
else if ( fm == FM_C )
{
printf("overview picture %s\n", target_font_identifier);
u8g2_SetupBuffer_TGA(&u8g2, &u8g2_cb_r0);
u8x8_InitDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetPowerSave(u8g2_GetU8x8(&u8g2), 0);
//u8g2_SetFont(&u8g2, u8g2_font_helvB14_tr);
u8g2_FirstPage(&u8g2);
do
{
overview_draw_table(i, 0, 60);
//overviewline(i, '@', 0, 80, cw);
} while( u8g2_NextPage(&u8g2) );
strcpy(tga_filename, target_font_identifier);
strcat(tga_filename, ".tga");
tga_save("font.tga");
sprintf(convert_cmd, "convert font.tga -trim %s.png", target_font_identifier );
system(convert_cmd);
u8g2_fnt_cnt++;
}
}
void overviewshortpic(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
int cw, ch;
if ( fm == FM_8 )
{
printf("8x8 font short overview picture %s\n", target_font_identifier);
u8g2_SetupBuffer_TGA(&u8g2, &u8g2_cb_r0);
u8x8_InitDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetPowerSave(u8g2_GetU8x8(&u8g2), 0);
//u8x8_ClearDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetFont(u8g2_GetU8x8(&u8g2), u8x8_font_list[u8x8_fnt_cnt]);
if ( mm == MM_N )
u8x8_DrawString(u8g2_GetU8x8(&u8g2), 0, 0, "1234567890");
else if ( mm == MM_U )
u8x8_DrawString(u8g2_GetU8x8(&u8g2), 0, 0, "ABCDEF 123");
else
u8x8_DrawString(u8g2_GetU8x8(&u8g2), 0, 0, "Abcdefg 123");
tga_save("font.tga");
sprintf(convert_cmd, "convert font.tga -trim %s_short.png", target_font_identifier );
system(convert_cmd);
u8x8_fnt_cnt++;
}
else if ( fm == FM_C )
{
printf("short overview picture %s\n", target_font_identifier);
u8g2_SetupBuffer_TGA(&u8g2, &u8g2_cb_r0);
u8x8_InitDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetPowerSave(u8g2_GetU8x8(&u8g2), 0);
//u8g2_SetFont(&u8g2, u8g2_font_helvB14_tr);
u8g2_SetFont(&u8g2, u8g2_font_list[u8g2_fnt_cnt]);
u8g2_SetFontDirection(&u8g2, 0);
ch = u8g2_GetMaxCharHeight(&u8g2);
cw = u8g2_GetMaxCharWidth(&u8g2);
u8g2_FirstPage(&u8g2);
do
{
if ( mm == MM_N )
u8g2_DrawStr(&u8g2, 0, ch, "1234567890");
else if ( mm == MM_U )
u8g2_DrawStr(&u8g2, 0, ch, "ABCDEF 123");
else
u8g2_DrawStr(&u8g2, 0, ch, "Abcdefg 123");
} while( u8g2_NextPage(&u8g2) );
tga_save("font.tga");
sprintf(convert_cmd, "convert font.tga -trim %s_short.png", target_font_identifier );
system(convert_cmd);
u8g2_fnt_cnt++;
}
}
int font_found_for_this_size = 0;
int mfont_found_for_this_size = 0;
void generate_font_list(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
if ( fm == FM_8 )
{
if ( current_capital_A_size == 8 )
{
fprintf(fntlist8x8, " ", target_font_identifier, target_font_identifier);
fprintf(fntlist8x8, "%s ", target_font_identifier);
fprintf(fntlist8x8, " [%s](%s)\n\n", gi[fi[i].group].groupname, gi[fi[i].group].reference);
u8x8_fnt_cnt++;
}
}
else if ( fm == FM_C )
{
u8g2_SetupBuffer_TGA(&u8g2, &u8g2_cb_r0);
u8x8_InitDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetPowerSave(u8g2_GetU8x8(&u8g2), 0);
if ( u8g2_font_list[u8g2_fnt_cnt] != NULL )
{
u8g2_SetFont(&u8g2, u8g2_font_list[u8g2_fnt_cnt]);
u8g2_SetFontDirection(&u8g2, 0);
if ( current_capital_A_size == u8g2.font_info.ascent_A )
{
if ( font_found_for_this_size == 0 )
{
fprintf(fntlistall, "\n## %d Pixel Height\n\n", current_capital_A_size);
printf("listall: == %d ==\n", current_capital_A_size);
}
font_found_for_this_size = 1;
fprintf(fntlistall, " ", target_font_identifier, target_font_identifier);
fprintf(fntlistall, "%s ", target_font_identifier);
fprintf(fntlistall, " [%s](%s)\n\n", gi[fi[i].group].groupname, gi[fi[i].group].reference);
//printf("%d: %s %s\n", current_capital_A_size, target_font_identifier, gi[fi[i].group].groupname);
}
if ( bm == BM_M || bm == BM_8 )
{
if ( current_capital_A_size == u8g2.font_info.ascent_A )
{
if ( mfont_found_for_this_size == 0 )
{
fprintf(fntlistmono, "\n## %d Pixel Height\n\n", current_capital_A_size);
printf("listmono: == %d ==\n", current_capital_A_size);
}
mfont_found_for_this_size = 1;
fprintf(fntlistmono, " ", target_font_identifier, target_font_identifier);
fprintf(fntlistmono, "%s ", target_font_identifier);
fprintf(fntlistmono, " [%s](%s)\n\n", gi[fi[i].group].groupname, gi[fi[i].group].reference);
}
}
u8g2_fnt_cnt++;
}
}
}
void do_font_list(cbfn_t cb)
{
file_copy("fntlistall.pre", fntlistallpath);
fntlistall = fopen(fntlistallpath, "r+");
fseek(fntlistall, 0L, SEEK_END);
fntlistmono = fopen(fntlistmonopath, "w");
fntlist8x8 = fopen(fntlist8x8path, "w");
fprintf(fntlistall, "# All U8g2 Fonts, Capital A Height\n\n");
fprintf(fntlistmono, "# Monospaced and 8x8 Fonts for U8g2, Capital A Height\n\n");
fprintf(fntlist8x8, "# Fonts for U8x8\n\n");
for( current_capital_A_size = 2; current_capital_A_size < 100; current_capital_A_size++ )
{
font_found_for_this_size = 0;
mfont_found_for_this_size = 0;
u8x8_fnt_cnt = 0;
u8g2_fnt_cnt = 0;
do_font_loop(cb);
}
fclose(fntlistall);
fclose(fntlistmono);
fclose(fntlist8x8);
}
#endif
void bdfconv(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
if ( fi[i].ttf_opt != NULL )
{
strcpy(otf_cmd, otf2bdf_path);
strcat(otf_cmd, " ");
strcat(otf_cmd, fi[i].ttf_opt);
strcat(otf_cmd, " ../ttf/");
strcat(otf_cmd, fi[i].filename);
strcat(otf_cmd, " -o tmp.bdf");
printf("%s\n", otf_cmd);
system(otf_cmd);
}
strcpy(bdf_cmd, bdfconv_path);
strcat(bdf_cmd, " ");
if ( fi[i].bdfconv_opt != 0 )
{
strcat(bdf_cmd, fi[i].bdfconv_opt);
strcat(bdf_cmd, " ");
}
if ( fm == FM_C ) strcat(bdf_cmd, " -f 1");
if ( fm == FM_8 ) strcat(bdf_cmd, " -f 2");
if ( bm == BM_T ) strcat(bdf_cmd, " -b 0");
if ( bm == BM_H ) strcat(bdf_cmd, " -b 1");
if ( bm == BM_M ) strcat(bdf_cmd, " -b 2");
if ( bm == BM_8 ) strcat(bdf_cmd, " -b 3");
if ( mm == MM_F ) strcat(bdf_cmd, " -m '32-255>32'");
if ( mm == MM_R ) strcat(bdf_cmd, " -m '32-127>32'");
if ( mm == MM_N ) strcat(bdf_cmd, " -m '32,42-58>42'");
if ( mm == MM_U ) strcat(bdf_cmd, " -m '32-95>32'");
if ( mm == MM_E ) strcat(bdf_cmd, " -m '32-701>32,7838,64256-64263'");
if ( mm == MM_C )
{
strcat(bdf_cmd, " -m '");
strcat(bdf_cmd, fi[i].map_custom);
strcat(bdf_cmd, "'");
}
if ( mm == MM_M )
{
strcat(bdf_cmd, " -M '");
strcat(bdf_cmd, fi[i].map_custom);
strcat(bdf_cmd, "'");
}
strcat(bdf_cmd, " ");
if ( fi[i].ttf_opt != NULL )
{
strcat(bdf_cmd, "tmp.bdf");
}
else
{
strcat(bdf_cmd, bdf_path);
strcat(bdf_cmd, fi[i].filename);
}
strcat(bdf_cmd, " -n ");
strcat(bdf_cmd, target_font_identifier);
strcat(bdf_cmd, " -o ");
//strcat(bdf_cmd, target_font_identifier);
strcat(bdf_cmd, "font");
strcat(bdf_cmd, ".c");
/*
if ( fi[i].kerning_min_distance_per_cent > 0 )
{
strcat(bdf_cmd, " -k ");
strcat(bdf_cmd, target_font_identifier);
strcat(bdf_cmd, "_k.c");
strcat(bdf_cmd, " -p ");
sprintf(bdf_cmd+strlen(bdf_cmd), "%d", fi[i].kerning_min_distance_per_cent);
}
*/
/*
fprintf(out_fp, "const uint8_t %s[%d] U8X8_FONT_SECTION(\"%s\") \n", fontname, bf->target_cnt, fontname);
fprintf(out_fp, "const uint8_t %s[%d] U8G2_FONT_SECTION(\"%s\") \n", fontname, bf->target_cnt, fontname);
*/
strcpy(font_prototype, "extern const uint8_t ");
strcat(font_prototype, target_font_identifier);
strcat(font_prototype, "[]");
if ( fm == FM_8 )
{
strcat(bdf_cmd, " && cat font.c >>");
strcat(bdf_cmd, u8x8_fonts_filename);
strcat(font_prototype, " U8X8_FONT_SECTION(\"");
strcat(font_prototype, target_font_identifier);
strcat(font_prototype, "\");\n");
add_to_str(&u8x8_prototypes, font_prototype);
}
else
{
strcat(bdf_cmd, " && cat font.c >>");
strcat(bdf_cmd, u8g2_fonts_filename);
strcat(font_prototype, " U8G2_FONT_SECTION(\"");
strcat(font_prototype, target_font_identifier);
strcat(font_prototype, "\");\n");
add_to_str(&u8g2_prototypes, font_prototype);
}
printf("%s\n", bdf_cmd);
system(bdf_cmd);
strcpy(bdf_cmd, "cp font.c ./single_font_files/");
strcat(bdf_cmd, target_font_identifier);
strcat(bdf_cmd, ".c");
system(bdf_cmd);
}
void fontlist_identifier(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
if ( fm == FM_C )
{
fprintf(u8g2_font_list_fp, " %s,\n", target_font_identifier);
}
if ( fm == FM_8 )
{
fprintf(u8x8_font_list_fp, " %s,\n", target_font_identifier);
}
}
void fontlist_name(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
if ( fm == FM_C )
{
fprintf(u8g2_font_list_fp, " \"%s\",\n", target_font_identifier);
}
if ( fm == FM_8 )
{
fprintf(u8x8_font_list_fp, " \"%s\",\n", target_font_identifier);
}
fprintf(keywords_fp, "%s\tLITERAL1\n", target_font_identifier);
}
void generate_font_group_md(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
static int _i = 0;
static int _fm = 0;
static int _bm = 0;
if ( fi[i].group == current_font_group_index )
{
if ( strcmp( current_font_name, fi[i].name ) != 0 )
{
strcpy(current_font_name, fi[i].name);
fprintf(current_md_file, "\n");
fprintf(current_md_file, "## %s\n", current_font_name);
printf("## %s\n", current_font_name);
}
else
{
if ( _i == i && _fm == fm && _bm == bm )
{
}
else
{
fprintf(current_md_file, "\n");
}
}
fprintf(current_md_file, "\n", target_font_identifier, target_font_identifier);
_i = i;
_fm = fm;
_bm = bm;
printf( "%s %s\n", gi[current_font_group_index].mdfile, target_font_identifier);
}
}
#ifdef BUILD2
void generate_font_group_word_cloud(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms)
{
static int _i = 0;
static int _fm = 0;
static int _bm = 0;
if ( fi[i].group == current_font_group_index && fm == FM_C )
{
if ( strcmp( current_font_name, fi[i].name ) != 0 )
{
strcpy(current_font_name, fi[i].name);
//fprintf(current_md_file, "\n");
//fprintf(current_md_file, "## %s\n", current_font_name);
//printf("## %s\n", current_font_name);
}
else
{
if ( _i == i && _fm == fm && _bm == bm )
{
}
else
{
// printf( "group %s, %s, font %s %s\n", gi[current_font_group_index].groupname, gi[current_font_group_index].reference, fi[i].name, target_font_identifier);
//fprintf(current_md_file, "\n");
}
}
//fprintf(current_md_file, "\n", target_font_identifier, target_font_identifier);
if ( _i == i )
{
//
}
else
{
//u8g2_font_list[u8g2_fnt_cnt]
cloud_auto_add(&u8g2, u8g2_font_list[u8g2_fnt_cnt]);
//printf( "%d: group %s, %s, font %s %s %d %s\n", i, gi[current_font_group_index].groupname, gi[current_font_group_index].reference, fi[i].name, target_font_identifier, u8g2_fnt_cnt, u8g2_font_names[u8g2_fnt_cnt]);
}
_i = i;
_fm = fm;
_bm = bm;
}
if ( fm == FM_C )
{
u8g2_fnt_cnt++;
}
}
#endif
void gen_font(int i, int fm, char *fms, int bm, char *bms, int mm, char *mms, cbfn_t cb )
{
if ( fm == FM_8 )
if ( bm != BM_8 )
return;
strcpy(target_font_identifier, fms);
strcat(target_font_identifier, "_font_");
strcat(target_font_identifier, fi[i].name);
if ( bms[0] != '\0' || mms[0] != '\0' )
{
strcat(target_font_identifier, "_");
strcat(target_font_identifier, bms);
strcat(target_font_identifier, mms);
}
cb(i, fm,fms,bm,bms,mm,mms);
}
void map_font(int i, int fm, char *fms, int bm, char *bms, cbfn_t cb)
{
if ( (fi[i].map_mode & MM_F) != 0 )
gen_font(i, fm, fms, bm, bms, MM_F, "f", cb);
if ( (fi[i].map_mode & MM_R) != 0 )
gen_font(i, fm, fms, bm, bms, MM_R, "r", cb);
if ( (fi[i].map_mode & MM_N) != 0 )
gen_font(i, fm, fms, bm, bms, MM_N, "n", cb);
if ( (fi[i].map_mode & MM_U) != 0 )
gen_font(i, fm, fms, bm, bms, MM_U, "u", cb);
if ( (fi[i].map_mode & MM_C) != 0 )
gen_font(i, fm, fms, bm, bms, MM_C, fi[i].map_custom_postfix, cb);
if ( (fi[i].map_mode & MM_M) != 0 )
gen_font(i, fm, fms, bm, bms, MM_M, fi[i].map_custom_postfix, cb);
if ( (fi[i].map_mode & MM_E) != 0 )
gen_font(i, fm, fms, bm, bms, MM_E, "e", cb);
}
void build_font(int i, int fm, char *fms, cbfn_t cb)
{
if ( (fi[i].build_mode & BM_T) != 0 )
map_font(i, fm, fms, BM_T, "t", cb);
if ( (fi[i].build_mode & BM_H) != 0 )
map_font(i, fm, fms, BM_H, "h", cb);
if ( (fi[i].build_mode & BM_M) != 0 )
map_font(i, fm, fms, BM_M, "m", cb);
if ( (fi[i].build_mode & BM_8) != 0 )
{
if ( fm == FM_8 )
map_font(i, fm, fms, BM_8, "", cb);
else
map_font(i, fm, fms, BM_8, "8", cb);
}
}
void process_font(int i, cbfn_t cb)
{
FILE *fp;
static char s[1024];
if ( fi[i].ttf_opt == 0 )
{
strcpy(s,bdf_path);
}
else
{
strcpy(s,"../ttf/");
}
strcat(s, fi[i].filename);
fp = fopen(s, "r");
if ( fp == NULL )
{
printf("font %s missing\n",s );
return;
}
fclose(fp);
if ( (fi[i].font_mode & FM_C) != 0 )
build_font(i, FM_C, "u8g2", cb);
if ( (fi[i].font_mode & FM_8) != 0 )
build_font(i, FM_8, "u8x8", cb);
}
void do_font_loop(cbfn_t cb)
{
int i, cnt;
cnt = sizeof(fi)/sizeof(*fi);
for( i = 0; i < cnt; i++ )
{
process_font(i, cb);
}
}
void do_font_groups(cbfn_t cb)
{
int cnt;
cnt = sizeof(gi)/sizeof(*gi);
for( current_font_group_index = 0; current_font_group_index < cnt; current_font_group_index++ )
{
file_copy(gi[current_font_group_index].mdprefixfile, gi[current_font_group_index].mdfile);
current_md_file = fopen(gi[current_font_group_index].mdfile, "a");
fprintf(current_md_file, "\n");
strcpy(current_font_name, ".");
#ifdef BUILD2
u8g2_fnt_cnt = 0;
u8x8_fnt_cnt = 0;
#endif
do_font_loop(cb);
fclose(current_md_file);
}
}
void do_font_groups_wc(cbfn_t cb)
{
int cnt;
cnt = sizeof(gi)/sizeof(*gi);
for( current_font_group_index = 0; current_font_group_index < cnt; current_font_group_index++ )
{
#ifdef BUILD2
u8g2_fnt_cnt = 0;
u8x8_fnt_cnt = 0;
u8g2_SetupBuffer_TGA(&u8g2, &u8g2_cb_r0);
u8x8_InitDisplay(u8g2_GetU8x8(&u8g2));
u8x8_SetPowerSave(u8g2_GetU8x8(&u8g2), 0);
u8g2_SetFontPosTop(&u8g2);
cloud_init();
do_font_loop(cb);
cloud_calculate(4);
u8g2_FirstPage(&u8g2);
do
{
cloud_draw(&u8g2);
} while( u8g2_NextPage(&u8g2) );
tga_save("font.tga");
sprintf(convert_cmd, "convert font.tga -trim %s_word_cloud.png", gi[current_font_group_index].reference );
system(convert_cmd);
printf("Group end %s\n", gi[current_font_group_index].reference);
#endif
}
}
int main(void)
{
//unlink(u8x8_fonts_filename);
//unlink(u8g2_fonts_filename);
#ifndef BUILD2
if ( file_copy("u8x8_fonts.pre", u8x8_fonts_filename) == 0 )
return 0;
if ( file_copy("u8g2_fonts.pre", u8g2_fonts_filename) == 0 )
return 0;
if ( file_copy("keywords.pre", "keywords.txt") == 0 )
return 0;
do_font_loop(bdfconv);
u8g2_font_list_fp = fopen("u8g2_font_list.c", "w");
u8x8_font_list_fp = fopen("u8x8_font_list.c", "w");
keywords_fp = fopen("keywords.txt", "a");
fprintf(u8g2_font_list_fp, "/* u8g2_font_list.c */\n");
fprintf(u8x8_font_list_fp, "/* u8x8_font_list.c */\n");
fprintf(u8g2_font_list_fp, "#include \"u8g2.h\"\n");
fprintf(u8x8_font_list_fp, "#include \"u8g2.h\"\n");
fprintf(u8g2_font_list_fp, "const uint8_t *u8g2_font_list[] = {\n");
fprintf(u8x8_font_list_fp, "const uint8_t *u8x8_font_list[] = {\n");
do_font_loop(fontlist_identifier);
fprintf(u8g2_font_list_fp, " NULL\n};\n");
fprintf(u8x8_font_list_fp, " NULL\n};\n");
fprintf(u8g2_font_list_fp, "char *u8g2_font_names[] = {\n");
fprintf(u8x8_font_list_fp, "char *u8x8_font_names[] = {\n");
do_font_loop(fontlist_name);
fprintf(u8g2_font_list_fp, " NULL\n};\n");
fprintf(u8x8_font_list_fp, " NULL\n};\n");
fclose(u8g2_font_list_fp);
fclose(u8x8_font_list_fp);
fclose(keywords_fp);
printf("update u8g2.h\n");
insert_into_file("../../../csrc/u8g2.h", u8g2_prototypes, "/* start font list */", "/* end font list */");
printf("update u8x8.h\n");
insert_into_file("../../../csrc/u8x8.h", u8x8_prototypes, "/* start font list */", "/* end font list */");
unlink("font.c");
do_font_groups(generate_font_group_md);
#endif
#ifdef BUILD2
u8g2_fnt_cnt = 0;
u8x8_fnt_cnt = 0;
do_font_loop(overviewpic);
u8g2_fnt_cnt = 0;
u8x8_fnt_cnt = 0;
do_font_loop(overviewshortpic);
do_font_list(generate_font_list);
do_font_groups_wc(generate_font_group_word_cloud);
#endif
return 0;
}
|
the_stack_data/90763336.c | /* Copyright (C) 1992, 1995, 1996 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with the GNU C Library; see the file COPYING.LIB. If not,
see <http://www.gnu.org/licenses/>. */
#include <features.h>
#include <stddef.h>
#include <search.h>
#ifdef L_insque
/* Insert ELEM into a doubly-linked list, after PREV. */
void
insque (void *elem, void *prev)
{
if (prev == NULL)
{
((struct qelem *) elem)->q_forw = NULL;
((struct qelem *) elem)->q_back = NULL;
}
else
{
struct qelem *next = ((struct qelem *) prev)->q_forw;
((struct qelem *) prev)->q_forw = (struct qelem *) elem;
if (next != NULL)
next->q_back = (struct qelem *) elem;
((struct qelem *) elem)->q_forw = next;
((struct qelem *) elem)->q_back = (struct qelem *) prev;
}
}
#endif
#ifdef L_remque
/* Unlink ELEM from the doubly-linked list that it is in. */
void
remque (void *elem)
{
struct qelem *next = ((struct qelem *) elem)->q_forw;
struct qelem *prev = ((struct qelem *) elem)->q_back;
if (next != NULL)
next->q_back = prev;
if (prev != NULL)
prev->q_forw = (struct qelem *) next;
}
#endif
|
the_stack_data/162642628.c | /**
* \file *********************************************************************
*
* \brief Implementation of vendor-specific data handling
*
* Copyright (c) 2014-2015 Atmel Corporation. All rights reserved.
*
* \asf_license_start
*
* \page License
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. The name of Atmel may not be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* 4. This software may only be redistributed and used in connection with an
* Atmel microcontroller product.
*
* THIS SOFTWARE IS PROVIDED BY ATMEL "AS IS" AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT ARE
* EXPRESSLY AND SPECIFICALLY DISCLAIMED. IN NO EVENT SHALL ATMEL BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* \asf_license_stop
*/
/*
* Copyright (c) 2014-2015 Atmel Corporation. All rights reserved.
*
* Licensed under Atmel's Limited License Agreement --> EULA.txt
*/
#ifdef VENDOR_DATA
/* === INCLUDES ============================================================ */
#include <stdio.h>
#include "rf4ce.h"
#include "zrc.h"
#include "vendor_data.h"
#include "pal.h"
#include "tal.h"
#ifdef FLASH_SUPPORT
#include "pal_flash.h"
#endif
#ifdef BOOT_FLASH
#include "pal_boot_flash.h"
#endif
#ifdef TFA_BAT_MON
#include "tfa.h"
#endif
#include "conf_board.h"
/* === MACROS ============================================================== */
/* Flash start address of the firmware image .*/
#define IMAGE_START_ADDR ((uint32_t)60 * 1024)
/* Maximum size of the firmware image .*/
#define IMAGE_SIZE ((uint32_t)60 * 1024)
/* === EXTERNALS =========================================================== */
FLASH_EXTERN(uint16_t VendorIdentifier);
#ifdef RF4CE_CALLBACK_PARAM
#ifdef RF4CE_TARGET
extern void vendor_data_confirm(nwk_enum_t Status, uint8_t PairingRef, profile_id_t ProfileId
#ifdef NLDE_HANDLE
, uint8_t Handle
#endif
);
#else /* RF4CE_TARGET */
extern void nlme_rx_enable_confirm(nwk_enum_t Status);
static void vendor_data_confirm(nwk_enum_t Status, uint8_t PairingRef, profile_id_t ProfileId
#ifdef NLDE_HANDLE
, uint8_t Handle
#endif
);
void vendor_data_ind(uint8_t PairingRef, uint16_t VendorId,
uint8_t nsduLength, uint8_t *nsdu, uint8_t RxLinkQuality,
uint8_t RxFlags);
#endif /* RF4CE_TARGET */
#endif /* RF4CE_CALLBACK_PARAM */
/* === IMPLEMENTATION ====================================================== */
bool vendor_data_request(uint8_t PairingRef, profile_id_t ProfileId,
uint16_t VendorId, uint8_t nsduLength, uint8_t *nsdu,
uint8_t TxOptions)
{
/* Keep compiler happy */
ProfileId = ProfileId;
return nlde_data_request(PairingRef, PROFILE_ID_ZRC, VendorId,
nsduLength, nsdu, TxOptions
#ifdef NLDE_HANDLE
, 1
#endif
#ifdef RF4CE_CALLBACK_PARAM
, (FUNC_PTR)vendor_data_confirm
#endif
);
}
#ifndef RF4CE_TARGET
void vendor_data_ind(uint8_t PairingRef, uint16_t VendorId,
uint8_t nsduLength, uint8_t *nsdu, uint8_t RxLinkQuality,
uint8_t RxFlags)
{
/* Check if vendor id matches.
* Handle here only vendor data from same vendor */
uint16_t v_id = PGM_READ_WORD(&VendorIdentifier);
uint8_t nsduHandle = 1;
if ((VendorId == v_id) && (RxFlags & RX_FLAG_WITH_SEC)) {
switch (nsdu[0]) { /* vendor-specific command id */
#ifdef TFA_BAT_MON
case BATTERY_STATUS_REQ:
{
uint16_t voltage = tfa_get_batmon_voltage();
nsdu[0] = BATTERY_STATUS_RESP;
nsdu[1] = (uint8_t)voltage; /* LSB */
nsdu[2] = (uint8_t)(voltage >> 8); /* MSB */
nsduLength = 3;
}
break;
#endif
case ALIVE_REQ: /* Alive request */
vendor_app_alive_req();
/* Send alive response */
nsdu[0] = ALIVE_RESP;
nsduLength = 1;
break;
case FW_VERSION_REQ:
{
/* Send alive response */
nsdu[0] = FW_VERSION_RESP;
nsdu[1] = FW_VERSION_MAJOR; /* major version number */
nsdu[2] = FW_VERSION_MINOR; /* minor version number */
nsdu[3] = FW_VERSION_REV; /* revision version number */
nsduLength = 4;
}
break;
case RX_ON_REQ:
{
uint32_t duration = 0;
memcpy(&duration, &nsdu[1], 3);
if (!nlme_rx_enable_request(duration
#ifdef RF4CE_CALLBACK_PARAM
, (FUNC_PTR)nlme_rx_enable_confirm
#endif
)) {
/*
* RX enable could not been added to the queue.
* Therefore do not send response message.
*/
return;
}
/* Send response */
nsdu[0] = RX_ON_RESP;
nsduLength = 1;
}
break;
#ifdef FLASH_SUPPORT
case FW_DATA_REQ:
{
fw_data_frame_t *fw_frame;
vendor_status_t status = VD_SUCCESS;
fw_frame = (fw_data_frame_t *)nsdu;
/* Verify data chunk size */
uint8_t fw_data_size = nsduLength - 5; /* 5 = header len
**/
if (fw_data_size > 64) {
status = VD_UNSUPPORTED_SIZE;
} else {
/* Fill temporary page buffer */
uint16_t start_addr
= (fw_frame->frame_cnt -
1) % 4;
flash_fill_page_buffer(start_addr *
(SPM_PAGESIZE / 4),
fw_data_size,
&fw_frame->fw_data[0]);
/* Write flash page */
if ((fw_frame->frame_cnt % 4) == 0) {
uint32_t page_start_addr;
page_start_addr = IMAGE_START_ADDR +
((uint32_t)
SPM_PAGESIZE *
((fw_frame->
frame_cnt /
4) - 1));
flash_program_page(page_start_addr);
} else if (fw_frame->frame_cnt ==
fw_frame->total_num_frames) {
uint32_t page_start_addr;
page_start_addr = IMAGE_START_ADDR +
((uint32_t)
SPM_PAGESIZE *
(fw_frame->
frame_cnt / 4));
flash_program_page(page_start_addr);
}
}
/* Send response */
nsdu[0] = FW_DATA_RESP;
nsdu[1] = status;
nsduLength = 2;
}
break;
#endif /* #ifdef FLASH_SUPPORT */
#ifdef FLASH_SUPPORT
case FW_SWAP_REQ:
{
/* Send response */
nsdu[0] = FW_SWAP_RESP;
nsduLength = 1;
nsduHandle = 2;
}
break;
#endif /* #ifdef FLASH_SUPPORT */
default:
{
/* Send response */
nsdu[0] = FW_DATA_RESP;
nsdu[1] = VD_NOT_SUPPORTED_ATTRIBUTE;
nsduLength = 2;
}
break;
}
/* Transmit response message */
nlde_data_request(PairingRef, PROFILE_ID_ZRC, VendorId,
nsduLength, nsdu,
TXO_UNICAST | TXO_DST_ADDR_NET | TXO_ACK_REQ | TXO_SEC_REQ | TXO_MULTI_CH | TXO_CH_NOT_SPEC | TXO_VEND_SPEC
#ifdef NLDE_HANDLE
, nsduHandle
#endif
#ifdef RF4CE_CALLBACK_PARAM
, (FUNC_PTR)vendor_data_confirm
#endif
);
/* Keep compiler happy */
RxLinkQuality = RxLinkQuality;
RxFlags = RxFlags;
}
}
#endif /* #ifndef RF4CE_TARGET */
#ifndef RF4CE_TARGET
#ifdef RF4CE_CALLBACK_PARAM
static
#endif
void vendor_data_confirm(nwk_enum_t Status, uint8_t PairingRef, profile_id_t ProfileId
#ifdef NLDE_HANDLE
, uint8_t Handle
#endif
)
{
#ifdef FLASH_SUPPORT
if (Handle == 2) {
/* This is the confirm for SWAP_RSP
* so initiate flash swap for activiting the new image */
flash_swap(IMAGE_START_ADDR, IMAGE_SIZE);
}
#endif
Status = Status;
PairingRef = PairingRef;
#ifdef NLDE_HANDLE
Handle = Handle;
ProfileId = ProfileId;
#endif
}
#endif
#endif /* #ifdef VENDOR_DATA */
|
the_stack_data/34513526.c | // we intentionally avoid using ++,-- in this test
int main() {
int sum=0;
for(int i=1;i<10;i=i+1) {
sum=sum+i;
}
return 0;
}
|
the_stack_data/89200450.c | /*
* Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.
*
* Licensed under the Apache License 2.0 (the "License"). You may not use
* this file except in compliance with the License. You can obtain a copy
* in the file LICENSE in the source distribution or at
* https://www.openssl.org/source/license.html
*/
/* We need to use the deprecated RSA low level calls */
#define OPENSSL_SUPPRESS_DEPRECATED
#include <openssl/err.h>
#include <openssl/rsa.h>
#include <openssl/ssl.h>
int SSL_use_RSAPrivateKey(SSL *ssl, RSA *rsa)
{
EVP_PKEY *pkey;
int ret;
if (rsa == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_PASSED_NULL_PARAMETER);
return 0;
}
if ((pkey = EVP_PKEY_new()) == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_EVP_LIB);
return 0;
}
RSA_up_ref(rsa);
if (EVP_PKEY_assign_RSA(pkey, rsa) <= 0) {
RSA_free(rsa);
EVP_PKEY_free(pkey);
return 0;
}
ret = SSL_use_PrivateKey(ssl, pkey);
EVP_PKEY_free(pkey);
return ret;
}
int SSL_use_RSAPrivateKey_file(SSL *ssl, const char *file, int type)
{
int j, ret = 0;
BIO *in;
RSA *rsa = NULL;
in = BIO_new(BIO_s_file());
if (in == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_BUF_LIB);
goto end;
}
if (BIO_read_filename(in, file) <= 0) {
ERR_raise(ERR_LIB_SSL, ERR_R_SYS_LIB);
goto end;
}
if (type == SSL_FILETYPE_ASN1) {
j = ERR_R_ASN1_LIB;
rsa = d2i_RSAPrivateKey_bio(in, NULL);
} else if (type == SSL_FILETYPE_PEM) {
j = ERR_R_PEM_LIB;
rsa = PEM_read_bio_RSAPrivateKey(in, NULL,
SSL_get_default_passwd_cb(ssl),
SSL_get_default_passwd_cb_userdata(ssl));
} else {
ERR_raise(ERR_LIB_SSL, SSL_R_BAD_SSL_FILETYPE);
goto end;
}
if (rsa == NULL) {
ERR_raise(ERR_LIB_SSL, j);
goto end;
}
ret = SSL_use_RSAPrivateKey(ssl, rsa);
RSA_free(rsa);
end:
BIO_free(in);
return ret;
}
int SSL_use_RSAPrivateKey_ASN1(SSL *ssl, const unsigned char *d, long len)
{
int ret;
const unsigned char *p;
RSA *rsa;
p = d;
if ((rsa = d2i_RSAPrivateKey(NULL, &p, (long)len)) == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_ASN1_LIB);
return 0;
}
ret = SSL_use_RSAPrivateKey(ssl, rsa);
RSA_free(rsa);
return ret;
}
int SSL_CTX_use_RSAPrivateKey(SSL_CTX *ctx, RSA *rsa)
{
int ret;
EVP_PKEY *pkey;
if (rsa == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_PASSED_NULL_PARAMETER);
return 0;
}
if ((pkey = EVP_PKEY_new()) == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_EVP_LIB);
return 0;
}
RSA_up_ref(rsa);
if (EVP_PKEY_assign_RSA(pkey, rsa) <= 0) {
RSA_free(rsa);
EVP_PKEY_free(pkey);
return 0;
}
ret = SSL_CTX_use_PrivateKey(ctx, pkey);
EVP_PKEY_free(pkey);
return ret;
}
int SSL_CTX_use_RSAPrivateKey_file(SSL_CTX *ctx, const char *file, int type)
{
int j, ret = 0;
BIO *in;
RSA *rsa = NULL;
in = BIO_new(BIO_s_file());
if (in == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_BUF_LIB);
goto end;
}
if (BIO_read_filename(in, file) <= 0) {
ERR_raise(ERR_LIB_SSL, ERR_R_SYS_LIB);
goto end;
}
if (type == SSL_FILETYPE_ASN1) {
j = ERR_R_ASN1_LIB;
rsa = d2i_RSAPrivateKey_bio(in, NULL);
} else if (type == SSL_FILETYPE_PEM) {
j = ERR_R_PEM_LIB;
rsa = PEM_read_bio_RSAPrivateKey(in, NULL,
SSL_CTX_get_default_passwd_cb(ctx),
SSL_CTX_get_default_passwd_cb_userdata(ctx));
} else {
ERR_raise(ERR_LIB_SSL, SSL_R_BAD_SSL_FILETYPE);
goto end;
}
if (rsa == NULL) {
ERR_raise(ERR_LIB_SSL, j);
goto end;
}
ret = SSL_CTX_use_RSAPrivateKey(ctx, rsa);
RSA_free(rsa);
end:
BIO_free(in);
return ret;
}
int SSL_CTX_use_RSAPrivateKey_ASN1(SSL_CTX *ctx, const unsigned char *d,
long len)
{
int ret;
const unsigned char *p;
RSA *rsa;
p = d;
if ((rsa = d2i_RSAPrivateKey(NULL, &p, (long)len)) == NULL) {
ERR_raise(ERR_LIB_SSL, ERR_R_ASN1_LIB);
return 0;
}
ret = SSL_CTX_use_RSAPrivateKey(ctx, rsa);
RSA_free(rsa);
return ret;
}
|
the_stack_data/3990.c | /*
Author : Arnob Mahmud
mail : [email protected]
*/
#include <stdio.h>
#include <math.h>
void main(int argc, char const *argv[])
{
int i, n, rem, temp, sum, count, amc = 0;
printf("Enter n : ");
scanf("%d", &n);
i = 1;
while (amc != n)
{
count = 0;
temp = i;
while (temp != 0)
{
count++;
temp /= 10;
}
temp = i;
sum = 0;
while (temp != 0)
{
rem = temp % 10;
sum += pow(rem, count);
temp /= 10;
}
if (sum == i)
{
amc++;
printf("%d ", i);
}
i++;
}
printf("\n%dth armstrong number %d", n, i - 1);
}
|
the_stack_data/901303.c | #include<stdio.h>
int main(void)
{
int month[] = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
char *day[] = { "SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT" };
int x, y;
scanf("%d %d", &x, &y);
printf("%s", day[(month[x - 1] + y) % 7]);
return 0;
}
|
the_stack_data/808376.c | /******************************************************************************
* Copyright (C) 2017 - 2020 Xilinx, Inc. All rights reserved.
* SPDX-License-Identifier: MIT
*******************************************************************************/
/*****************************************************************************/
/**
*
* @file xrfdc_g.c
* @addtogroup rfdc_v10_0
* @{
*
* This file contains a configuration table that specifies the configuration of
* RFdc devices in the system.
*
* <pre>
* MODIFICATION HISTORY:
*
* Ver Who Date Changes
* ----- --- -------- -----------------------------------------------
* 1.0 sk 05/16/17 Initial release
* 5.1 cog 01/29/19 Added FSMax, NumSlice & IP_Type.
* 7.0 cog 05/13/19 Formatting changes.
* 8.0 cog 02/10/20 Updated addtogroup.
* cog 02/10/20 Added Silicon_Revision.
* 8.1 cog 06/24/20 Upversion.
* 9.0 cog 11/25/20 Upversion.
* 10.0 cog 11/26/20 Refactor and split files.
*
* </pre>
*
******************************************************************************/
#ifdef __BAREMETAL__
/***************************** Include Files ********************************/
#include "xparameters.h"
#include "xrfdc.h"
/************************** Constant Definitions ****************************/
/**************************** Type Definitions ******************************/
/***************** Macros (Inline Functions) Definitions ********************/
/************************** Variable Definitions ****************************/
/**
* The configuration table for devices
*/
XRFdc_Config XRFdc_ConfigTable[XPAR_XRFDC_NUM_INSTANCES] = {
{ XPAR_USP_RF_DATA_CONVERTER_0_DEVICE_ID,
XPAR_USP_RF_DATA_CONVERTER_0_BASEADDR,
XPAR_USP_RF_DATA_CONVERTER_0_HIGH_SPEED_ADC,
XPAR_USP_RF_DATA_CONVERTER_0_SYSREF_MASTER,
XPAR_USP_RF_DATA_CONVERTER_0_SYSREF_MASTER,
XPAR_USP_RF_DATA_CONVERTER_0_SYSREF_SOURCE,
XPAR_USP_RF_DATA_CONVERTER_0_SYSREF_SOURCE,
XPAR_USP_RF_DATA_CONVERTER_0_IP_TYPE,
XPAR_USP_RF_DATA_CONVERTER_0_SILICON_REVISION,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_DAC0_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE00_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL00,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE00,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE00,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE01_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL01,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE01,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE01,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE02_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL02,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE02,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE02,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE03_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL03,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE03,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE03,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE00,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH00,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE00,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO00_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER00_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE00,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE01,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH01,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE01,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO01_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER01_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE01,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE02,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH02,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE02,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO02_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER02_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE02,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE03,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH03,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE03,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO03_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER03_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE03,
},
},
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_DAC1_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE10_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL10,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE10,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE10,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE11_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL11,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE11,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE11,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE12_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL12,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE12,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE12,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE13_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL13,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE13,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE13,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE10,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH10,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE10,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO10_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER10_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE10,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE11,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH11,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE11,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO11_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER11_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE11,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE12,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH12,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE12,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO12_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER12_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE12,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE13,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH13,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE13,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO13_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER13_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE13,
},
},
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_DAC2_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE20_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL20,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE20,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE20,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE21_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL21,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE21,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE21,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE22_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL22,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE22,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE22,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE23_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL23,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE23,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE23,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE20,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH20,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE20,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO20_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER20_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE20,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE21,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH21,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE21,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO21_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER21_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE21,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE22,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH22,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE22,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO22_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER22_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE22,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE23,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH23,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE23,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO23_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER23_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE23,
},
},
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_DAC3_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE30_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL30,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE30,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE30,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE31_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL31,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE31,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE31,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE32_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL32,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE32,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE32,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_SLICE33_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INVSINC_CTRL33,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_MODE33,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DECODER_MODE33,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE30,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH30,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE30,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO30_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER30_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE30,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE31,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH31,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE31,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO31_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER31_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE31,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE32,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH32,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE32,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO32_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER32_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE32,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_TYPE33,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_DATA_WIDTH33,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_INTERPOLATION_MODE33,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_FIFO33_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_ADDER33_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_DAC_MIXER_TYPE33,
},
},
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_ADC0_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE00_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE00,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE01_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE01,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE02_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE02,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE03_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE03,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE00,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH00,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE00,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO00_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE00,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE01,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH01,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE01,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO01_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE01,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE02,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH02,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE02,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO02_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE02,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE03,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH03,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE03,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO03_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE03,
},
},
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_ADC1_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE10_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE10,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE11_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE11,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE12_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE12,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE13_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE13,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE10,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH10,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE10,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO10_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE10,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE11,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH11,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE11,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO11_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE11,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE12,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH12,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE12,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO12_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE12,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE13,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH13,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE13,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO13_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE13,
},
},
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_ADC2_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE20_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE20,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE21_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE21,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE22_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE22,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE23_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE23,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE20,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH20,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE20,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO20_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE20,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE21,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH21,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE21,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO21_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE21,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE22,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH22,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE22,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO22_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE22,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE23,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH23,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE23,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO23_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE23,
},
},
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_PLL_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_SAMPLING_RATE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_REFCLK_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_FABRIC_FREQ,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_FBDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_OUTDIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_REFCLK_DIV,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_BAND,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_FS_MAX,
XPAR_USP_RF_DATA_CONVERTER_0_ADC3_SLICES,
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE30_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE30,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE31_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE31,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE32_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE32,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_SLICE33_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_MODE33,
},
},
{
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE30,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH30,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE30,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO30_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE30,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE31,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH31,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE31,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO31_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE31,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE32,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH32,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE32,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO32_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE32,
},
{
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_TYPE33,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DATA_WIDTH33,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_DECIMATION_MODE33,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_FIFO33_ENABLE,
XPAR_USP_RF_DATA_CONVERTER_0_ADC_MIXER_TYPE33,
},
},
},
} }
};
#endif
/** @} */
|
the_stack_data/14593.c | #include <stdio.h>
#include <ctype.h>
#include <string.h>
int main(int argc, char * argv[])
{
/* 1 uppercase
* 0 as-is
* -1 lowercase
* 2 error
*/
int toDo = 2;
if (argc == 1) {
toDo = 0;
} else if (argc == 2) {
if (!strcmp(argv[1], "-p"))
toDo = 0;
else if (!strcmp(argv[1], "-u"))
toDo = 1;
else if (!strcmp(argv[1], "-l"))
toDo = -1;
else
puts("Invalid argument!");
} else
puts("Invalid number of arguments!");
int ch;
switch (toDo) {
case 0:
while ((ch = getchar()) != EOF)
putchar(ch);
break;
case -1:
while ((ch = getchar()) != EOF)
putchar(tolower(ch));
break;
case 1:
while ((ch = getchar()) != EOF)
putchar(toupper(ch));
break;
}
return 0;
}
|
the_stack_data/192331644.c | /* Example code for Exercises in C.
This program shows a way to represent a BigInt type (arbitrary length integers)
using C strings, with numbers represented as a string of decimal digits in reverse order.
Follow these steps to get this program working:
1) Read through the whole program so you understand the design.
2) Compile and run the program. It should run three tests, and they should fail.
3) Fill in the body of reverse_string(). When you get it working, the first test should pass.
4) Fill in the body of itoc(). When you get it working, the second test should pass.
5) Fill in the body of add_digits(). When you get it working, the third test should pass.
6) Uncomment the last test in main. If your three previous tests pass, this one should, too.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <assert.h>
/* reverse_string: Returns a new string with the characters reversed.
It is the caller's responsibility to free the result.
s: string
returns: string
*/
char *reverse_string(char *s) {
//TODO: Fill this in.
int begin, end, count = 0;
while (s[count] != '\0'){
count++;
}
char *cake=malloc(count*sizeof(*s));
end = count - 1;
for (begin = 0; begin < count; begin++) {
cake[begin] = s[end];
end--;
}
cake[begin] = '\0';
return cake;
}
/* ctoi: Converts a character to integer.
c: one of the characters '0' to '9'
returns: integer 0 to 9
*/
int ctoi(char c) {
assert(isdigit(c));
return c - '0';
}
/* itoc: Converts an integer to character.
i: integer 0 to 9
returns: character '0' to '9'
*/
char itoc(int i) {
//TODO: Fill this in, with an appropriate assertion.
assert(i<10);
return i + '0';
}
/* add_digits: Adds two decimal digits, returns the total and carry.
For example, if a='5', b='6', and carry='1', the sum is 12, so
the output value of total should be '2' and carry should be '1'
a: character '0' to '9'
b: character '0' to '9'
c: character '0' to '9'
total: pointer to char
carry: pointer to char
*/
void add_digits(char a, char b, char c, char *total, char *carry) {
//TODO: Fill this in.
int ai = ctoi(a);
int bi = ctoi(b);
int ci = ctoi(c);
int tot = ai+bi+ci;
*total=itoc(tot%10);
*carry = itoc(tot/10);;
}
/* Define a type to represent a BigInt.
Internally, a BigInt is a string of digits, with the digits in
reverse order.
*/
typedef char * BigInt;
/* add_bigint: Adds two BigInts
Stores the result in z.
x: BigInt
y: BigInt
carry_in: char
z: empty buffer
*/
void add_bigint(BigInt x, BigInt y, char carry_in, BigInt z) {
char total, carry_out;
int dx=1, dy=1, dz=1;
char a, b;
/* OPTIONAL TODO: Modify this function to allocate and return z
* rather than taking an empty buffer as a parameter.
* Hint: you might need a helper function.
*/
if (*x == '\0') {
a = '0';
dx = 0;
}else{
a = *x;
}
if (*y == '\0') {
b = '0';
dy = 0;
}else{
b = *y;
}
// printf("%c %c %c\n", a, b, carry_in);
add_digits(a, b, carry_in, &total, &carry_out);
// printf("%c %c\n", carry_out, total);
// if total and carry are 0, we're done
if (total == '0' && carry_out == '0') {
*z = '\0';
return;
}
// otherwise store the digit we just computed
*z = total;
// and make a recursive call to fill in the rest.
add_bigint(x+dx, y+dy, carry_out, z+dz);
}
/* print_bigint: Prints the digits of BigInt in the normal order.
big: BigInt
*/
void print_bigint(BigInt big) {
char c = *big;
if (c == '\0') return;
print_bigint(big+1);
printf("%c", c);
}
/* make_bigint: Creates and returns a BigInt.
Caller is responsible for freeing.
s: string of digits in the usual order
returns: BigInt
*/
BigInt make_bigint(char *s) {
char *r = reverse_string(s);
return (BigInt) r;
}
void test_reverse_string() {
char *s = "123";
char *t = reverse_string(s);
if (strcmp(t, "321") == 0) {
printf("reverse_string passed\n");
} else {
printf("reverse_string failed\n");
}
}
void test_itoc() {
char c = itoc(3);
if (c == '3') {
printf("itoc passed\n");
} else {
printf("itoc failed\n");
}
}
void test_add_digits() {
char total, carry;
add_digits('7', '4', '1', &total, &carry);
if (total == '2' && carry == '1') {
printf("add_digits passed\n");
} else {
printf("add_digits failed\n");
}
}
void test_add_bigint() {
char *s = "1";
char *t = "99999999999999999999999999999999999999999999";
char *res = "000000000000000000000000000000000000000000001";
BigInt big1 = make_bigint(s);
BigInt big2 = make_bigint(t);
BigInt big3 = malloc(100);
add_bigint(big1, big2, '0', big3);
if (strcmp(big3, res) == 0) {
printf("add_bigint passed\n");
} else {
printf("add_bigint failed\n");
}
}
int main (int argc, char *argv[])
{
test_reverse_string();
test_itoc();
test_add_digits();
//TODO: When you have the first three functions working,
// uncomment the following, and it should work.
test_add_bigint();
return 0;
}
|
the_stack_data/113034.c |
/*
* Compile using the command:
* `cc 27Stencil.c -o oa -fopenmp -lm`
*/
#include <math.h>
#include <omp.h>
#include <stdint.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#ifdef _OPENACC
#include <openacc.h>
#endif
#define DEFAULT_DATASIZE 1048576 /* Default datasize. */
#define DEFAULT_REPS 10 /* Default repetitions. */
#define CONF95 1.96
#define ITERATIONS 10
#define FAC (1./26)
#define TOLERANCE 1.0e-15
extern int reps; /* Repetitions. */
extern double *times; /* Array to store results in. */
extern int flag; /* Flag to set CPU or GPU invocation. */
extern unsigned int datasize; /* Datasize passed to benchmark functions. */
unsigned int datasize = -1; /* Datasize for tests in bytes. */
int reps = -1; /* Repetitions. */
double *times; /* Array of doubles storing the benchmark times in microseconds. */
double testtime; /* The average test time in microseconds for reps runs. */
double testsd; /* The standard deviation in the test time in microseconds for reps runs. */
int flag = 0; /* 0 indicates CPU. */
/*
* Function prototypes for common functions.
*/
void init(int argc, char **argv);
void finalisetest(char *);
void finalise(void);
void benchmark(char *, double (*test)(void));
void print_results(char *, double, double);
/* Forward Declarations of utility functions*/
double max_diff(double *, double *, int);
void wul();
void usage(char *argv[]) {
printf("Usage: %s \n"
"\t--reps <repetitions> (default %d)\n"
"\t--datasize <datasize> (default %d bytes)\n",
argv[0],
DEFAULT_REPS, DEFAULT_DATASIZE);
}
/*
* This function parses the parameters from the command line.
*/
void parse_args(int argc, char *argv[]) {
int arg;
for (arg = 1; arg < argc; arg++) {
if (strcmp(argv[arg], "--reps") == 0) {
reps = atoi(argv[++arg]);
if (reps == 0) {
printf("Invalid integer:--reps: %s\n", argv[arg]);
usage(argv);
exit(EXIT_FAILURE);
}
} else if (strcmp(argv[arg], "--datasize") == 0) {
datasize = atoi(argv[++arg]);
if (datasize == 0) {
printf("Invalid integer:--datasize: %s\n", argv[arg]);
usage(argv);
exit(EXIT_FAILURE);
}
} else if (strcmp(argv[arg], "-h") == 0) {
usage(argv);
exit(EXIT_SUCCESS);
} else {
printf("Invalid parameters: %s\n", argv[arg]);
usage(argv);
exit(EXIT_FAILURE);
}
}
}
void stats(double *mtp, double *sdp) {
double meantime, totaltime, sumsq, mintime, maxtime, sd;
int i, good_reps;
mintime = 1.0e10;
maxtime = 0.;
totaltime = 0.;
good_reps = 0;
for (i = 0; i < reps; i++) {
/* Skip entries where times is 0, this indicates an error occured */
if (times[i] != 0){
mintime = (mintime < times[i]) ? mintime : times[i];
maxtime = (maxtime > times[i]) ? maxtime : times[i];
totaltime += times[i];
good_reps++;
}
}
meantime = totaltime / good_reps;
sumsq = 0;
for (i = 0; i < reps; i++) {
if (times[i] != 0){
sumsq += (times[i] - meantime) * (times[i] - meantime);
}
}
sd = sqrt(sumsq / good_reps);
*mtp = meantime;
*sdp = sd;
}
/*
* This function prints the results of the tests.
* If you use a compiler which sets a different preprocessor flag
* you may wish to add it here.
*/
void print_results(char *name, double testtime, double testsd) {
char compiler[20];
/* Set default compiler idetifier. */
sprintf(compiler, "COMPILER");
/* Set compiler identifier based on known preprocessor flags. */
#ifdef __PGI
sprintf(compiler, "PGI");
#endif
#ifdef __HMPP
sprintf(compiler, "CAPS");
#endif
//printf("%s %s %d %f %f\n", compiler, name, datasize, testtime*1e6, CONF95*testsd*1e6);
printf("%f\n", testtime*1e6);
}
/*
* This function initialises the storage for the test results and set the defaults.
*/
void init(int argc, char **argv)
{
parse_args(argc, argv);
if (reps == -1) {
reps = DEFAULT_REPS;
}
if (datasize == (unsigned int)-1) {
datasize = DEFAULT_DATASIZE;
}
times = (double *)malloc((reps) * sizeof(double));
/*
#ifdef __PGI
acc_init(acc_device_nvidia);
// printf("PGI INIT\n");
#endif
#ifdef __HMPP
int a[5] = {1,2,3,4,5};
#pragma acc data copyin(a[0:5])
{}
#endif
#ifdef _CRAYC
int a[5] = {1,2,3,4,5};
#pragma acc data copyin(a[0:5])
{}
#endif
*/
}
void finalise(void) {
free(times);
}
/*
* This function runs the benchmark specified.
*/
void benchmark(char *name, double (*test)(void))
{
int i = 0;
double tmp = 0;
for (i=0; i<reps; i++) {
tmp = test();
if (tmp == -10000){
printf("Memory allocation failure in %s\n", name);
times[i] = 0;
}
else if (tmp == -11000){
printf("CPU/GPU mismatch in %s\n", name);
times[i] = 0;
}
else{
times[i] = tmp;
}
}
stats(&testtime, &testsd);
//printf("in benchmark\n");
print_results(name, testtime, testsd);
//printf("printed result\n");
}
double stencil()
{
extern unsigned int datasize;
int sz = cbrt((datasize/sizeof(double))/2);
int i, j, k, iter;
int n = sz-2;
double fac = FAC;
double t1, t2;
double md;
//printf("size = %d\n", sz);
/* Work buffers, with halos */
double *a0 = (double*)malloc(sizeof(double)*sz*sz*sz);
double *device_result = (double*)malloc(sizeof(double)*sz*sz*sz);
double *a1 = (double*)malloc(sizeof(double)*sz*sz*sz);
double *host_result = (double*)malloc(sizeof(double)*sz*sz*sz);
double *a0_init = (double*)malloc(sizeof(double)*sz*sz*sz);
if(a0==NULL||device_result==NULL||a1==NULL||host_result==NULL||a0_init==NULL){
/* Something went wrong in the memory allocation here, fail gracefully */
return(-10000);
}
/* initialize input array a0 */
/* zero all of array (including halos) */
//printf("size = %d\n", sz);
for (i = 0; i < sz; i++) {
for (j = 0; j < sz; j++) {
for (k = 0; k < sz; k++) {
a0[i*sz*sz+j*sz+k] = 0.0;
//printf("%d\t", (i*sz*sz+j*sz+k));
}
}
}
//printf("\n");
//int size_of_a0 = sizeof(a0) / sizeof(*a0);
//printf("size of a0 = %d\n", size_of_a0);
/* use random numbers to fill interior */
for (i = 1; i < n+1; i++) {
for (j = 1; j < n+1; j++) {
for (k = 1; k < n+1; k++) {
a0[i*sz*sz+j*sz+k] = (double) rand()/ (double)(1.0 + RAND_MAX);
}
}
}
/* memcpy(&a0_init[0], &a0[0], sizeof(double)*sz*sz*sz); */
/* save initial input array for later GPU run */
for (i = 0; i < sz; i++) {
for (j = 0; j < sz; j++) {
for (k = 0; k < sz; k++) {
a0_init[i*sz*sz+j*sz+k] = a0[i*sz*sz+j*sz+k];
}
}
}
//printf("Host computation\n");
/* run main computation on host */
for (iter = 0; iter < ITERATIONS; iter++) {
for (i = 1; i < n+1; i++) {
for (j = 1; j < n+1; j++) {
for (k = 1; k < n+1; k++) {
a1[i*sz*sz+j*sz+k] = (
a0[i*sz*sz+(j-1)*sz+k] + a0[i*sz*sz+(j+1)*sz+k] +
a0[(i-1)*sz*sz+j*sz+k] + a0[(i+1)*sz*sz+j*sz+k] +
a0[(i-1)*sz*sz+(j-1)*sz+k] + a0[(i-1)*sz*sz+(j+1)*sz+k] +
a0[(i+1)*sz*sz+(j-1)*sz+k] + a0[(i+1)*sz*sz+(j+1)*sz+k] +
a0[i*sz*sz+(j-1)*sz+(k-1)] + a0[i*sz*sz+(j+1)*sz+(k-1)] +
a0[(i-1)*sz*sz+j*sz+(k-1)] + a0[(i+1)*sz*sz+j*sz+(k-1)] +
a0[(i-1)*sz*sz+(j-1)*sz+(k-1)] + a0[(i-1)*sz*sz+(j+1)*sz+(k-1)] +
a0[(i+1)*sz*sz+(j-1)*sz+(k-1)] + a0[(i+1)*sz*sz+(j+1)*sz+(k-1)] +
a0[i*sz*sz+(j-1)*sz+(k+1)] + a0[i*sz*sz+(j+1)*sz+(k+1)] +
a0[(i-1)*sz*sz+j*sz+(k+1)] + a0[(i+1)*sz*sz+j*sz+(k+1)] +
a0[(i-1)*sz*sz+(j-1)*sz+(k+1)] + a0[(i-1)*sz*sz+(j+1)*sz+(k+1)] +
a0[(i+1)*sz*sz+(j-1)*sz+(k+1)] + a0[(i+1)*sz*sz+(j+1)*sz+(k+1)] +
a0[i*sz*sz+j*sz+(k-1)] + a0[i*sz*sz+j*sz+(k+1)]
) * fac;
}
}
}
for (i = 1; i < n+1; i++) {
for (j = 1; j < n+1; j++) {
for (k = 1; k < n+1; k++) {
a0[i*sz*sz+j*sz+k] = a1[i*sz*sz+j*sz+k];
}
}
}
} /* end iteration loop */
/* save result */
/* memcpy(&host_result[0], &a0[0], sizeof(double)*sz*sz*sz); */
for (i = 0; i < sz; i++) {
for (j = 0; j < sz; j++) {
for (k = 0; k < sz; k++) {
host_result[i*sz*sz+j*sz+k] = a0[i*sz*sz+j*sz+k];
// printf("%lf\t", a0[i*sz*sz+j*sz+k]);
}
}
}
//int size = sizeof(host_result)/sizeof(host_result[0]);
//for(i = 0; i < size; i++) {
// printf("%lf\t", host_result[i]);
//}
//printf("\n");
/* copy initial array back to a0 */
/* memcpy(&a0[0], &a0_init[0], sizeof(double)*sz*sz*sz); */
for (i = 0; i < sz; i++) {
for (j = 0; j < sz; j++) {
for (k = 0; k < sz; k++) {
a0[i*sz*sz+j*sz+k] = a0_init[i*sz*sz+j*sz+k];
}
}
}
//printf("Starting acc pragma code\n");
t1 = omp_get_wtime();
#pragma acc data copy(a0[0:sz*sz*sz]), create(a1[0:sz*sz*sz], i,j,k,iter), copyin(sz,fac,n)
{
for (iter = 0; iter < ITERATIONS; iter++) {
#pragma omp target teams distribute
for (i = 1; i < n+1; i++) {
for (j = 1; j < n+1; j++) {
#pragma omp simd
for (k = 1; k < n+1; k++) {
a1[i*sz*sz+j*sz+k] = (
a0[i*sz*sz+(j-1)*sz+k] + a0[i*sz*sz+(j+1)*sz+k] +
a0[(i-1)*sz*sz+j*sz+k] + a0[(i+1)*sz*sz+j*sz+k] +
a0[(i-1)*sz*sz+(j-1)*sz+k] + a0[(i-1)*sz*sz+(j+1)*sz+k] +
a0[(i+1)*sz*sz+(j-1)*sz+k] + a0[(i+1)*sz*sz+(j+1)*sz+k] +
a0[i*sz*sz+(j-1)*sz+(k-1)] + a0[i*sz*sz+(j+1)*sz+(k-1)] +
a0[(i-1)*sz*sz+j*sz+(k-1)] + a0[(i+1)*sz*sz+j*sz+(k-1)] +
a0[(i-1)*sz*sz+(j-1)*sz+(k-1)] + a0[(i-1)*sz*sz+(j+1)*sz+(k-1)] +
a0[(i+1)*sz*sz+(j-1)*sz+(k-1)] + a0[(i+1)*sz*sz+(j+1)*sz+(k-1)] +
a0[i*sz*sz+(j-1)*sz+(k+1)] + a0[i*sz*sz+(j+1)*sz+(k+1)] +
a0[(i-1)*sz*sz+j*sz+(k+1)] + a0[(i+1)*sz*sz+j*sz+(k+1)] +
a0[(i-1)*sz*sz+(j-1)*sz+(k+1)] + a0[(i-1)*sz*sz+(j+1)*sz+(k+1)] +
a0[(i+1)*sz*sz+(j-1)*sz+(k+1)] + a0[(i+1)*sz*sz+(j+1)*sz+(k+1)] +
a0[i*sz*sz+j*sz+(k-1)] + a0[i*sz*sz+j*sz+(k+1)]
) * fac;
}
}
}
#pragma acc parallel loop
for (i = 1; i < n+1; i++) {
#pragma acc loop
for (j = 1; j < n+1; j++) {
#pragma acc loop
for (k = 1; k < n+1; k++) {
a0[i*sz*sz+j*sz+k] = a1[i*sz*sz+j*sz+k];
}
}
}
} /* end iteration loop */
} /* end data region */
#pragma acc wait
t2 = omp_get_wtime();
memcpy(&device_result[0], &a0[0], sizeof(double)*sz*sz*sz);
md = max_diff(&host_result[0],&device_result[0], sz);
/* Free malloc'd memory to prevent leaks */
free(a0);
free(a0_init);
free(a1);
free(host_result);
free(device_result);
//printf("md: %lf \t tolerance: %lf", md, TOLERANCE);
if (md < TOLERANCE ){
//printf ("GPU matches host to within tolerance of %1.1e\n\n", TOLERANCE);
return(t2 - t1);
}
else{
// printf ("WARNING: GPU does not match to within tolerance of %1.1e\nIt is %lf\n", TOLERANCE, md);
return(-11000);
}
}
/* Utility Functions */
double max_diff(double *array1,double *array2, int sz)
{
double tmpdiff, diff;
int i,j,k;
int n = sz-2;
diff=0.0;
for (i = 1; i < n+1; i++) {
for (j = 1; j < n+1; j++) {
for (k = 1; k < n+1; k++) {
tmpdiff = fabs(array1[i*sz*sz+j*sz+k] - array2[i*sz*sz+j*sz+k]);
//printf("diff: %lf", tmpdiff);
if (tmpdiff > diff) diff = tmpdiff;
}
}
}
return diff;
}
/*
* This function ensures the device is awake.
* It is more portable than acc_init().
*/
void wul(){
int data = 8192;
double *arr_a = (double *)malloc(sizeof(double) * data);
double *arr_b = (double *)malloc(sizeof(double) * data);
int i = 0;
if (arr_a==NULL||arr_b==NULL) {
printf("Unable to allocate memory in wul.\n");
}
for (i=0;i<data;i++){
arr_a[i] = (double) (rand()/(1.0+RAND_MAX));
}
#pragma acc data copy(arr_b[0:data]), copyin(arr_a[0:data])
{
#pragma acc parallel loop
for (i=0;i<data;i++){
arr_b[i] = arr_a[i] * 2;
}
}
if (arr_a[0] < 0){
printf("Error in WUL\n");
/*
* This should never be called as rands should be in the range (0,1].
* This stops clever optimizers.
*/
}
free(arr_a);
free(arr_b);
}
int main(int argc, char **argv) {
char testName[32];
//printf("compiler name datasize testtime*1e6 CONF95*testsd*1e6\n");
/* Initialise storage for test results & parse input arguements. */
init(argc, argv);
/* Ensure device is awake. */
wul();
sprintf(testName, "27S");
benchmark(testName, &stencil);
/* Print results & free results storage */
finalise();
return EXIT_SUCCESS;
}
|
the_stack_data/134772.c | #include<stdio.h>
int main()
{
int marks[4][10]={{80, 95, 87, 98, 78, 57, 47, 78, 89, 78}, {78, 98 , 90, 78, 96, 91, 57 , 68, 98, 78},
{89, 98, 98 ,78, 90, 69, 65, 87, 90, 89}, {78, 98, 97, 78, 86, 56, 74, 73, 86, 97}
,{0, 0, 0, 0, 0, 0, 0, 0, 0, 0}};
int col;
for(col=0; col<10; col++){
marks[3][col]= marks[0][col] /4.0 + marks[1][col]/2.0 + marks[2][col]/2.0 ;
printf("Roll %d , Total marks: %d \n" , col+1, marks[3][col]);
}
return 0;
}
|
the_stack_data/353266.c |
extern void __VERIFIER_error() __attribute__ ((__noreturn__));
extern void __VERIFIER_assume(int);
void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: __VERIFIER_error(); } }
extern int __VERIFIER_nondet_int(void);
int N;
int main()
{
N = __VERIFIER_nondet_int();
if(N <= 0) return 1;
int i;
int sum[1];
int a[N];
sum[0] = 0;
for(i=0; i<N; i++)
{
a[i] = 1;
}
for(i=0; i<N; i++)
{
if(a[i] == 1) {
sum[0] = sum[0] + a[i];
} else {
sum[0] = sum[0] * a[i];
}
}
__VERIFIER_assert(sum[0] == N);
return 1;
}
|
the_stack_data/98576108.c | int main () {
int a;
a = 12;
int t;
putint(a);
return 0;
}
|
the_stack_data/54881.c | /**
*****************************************************************************
**
** File : syscalls.c
**
** Author : Auto-generated by System workbench for STM32
**
** Abstract : System Workbench Minimal System calls file
**
** For more information about which c-functions
** need which of these lowlevel functions
** please consult the Newlib libc-manual
**
** Target : STMicroelectronics STM32
**
** Distribution: The file is distributed “as is,” without any warranty
** of any kind.
**
*****************************************************************************
** @attention
**
** <h2><center>© COPYRIGHT(c) 2019 STMicroelectronics</center></h2>
**
** Redistribution and use in source and binary forms, with or without modification,
** are permitted provided that the following conditions are met:
** 1. Redistributions of source code must retain the above copyright notice,
** this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright notice,
** this list of conditions and the following disclaimer in the documentation
** and/or other materials provided with the distribution.
** 3. Neither the name of STMicroelectronics nor the names of its contributors
** may be used to endorse or promote products derived from this software
** without specific prior written permission.
**
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
** AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
** IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
** FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
** DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
** CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
** OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
**
*****************************************************************************
*/
/* Includes */
#include <sys/stat.h>
#include <stdlib.h>
#include <errno.h>
#include <stdio.h>
#include <signal.h>
#include <time.h>
#include <sys/time.h>
#include <sys/times.h>
/* Variables */
//#undef errno
extern int errno;
extern int __io_putchar(int ch) __attribute__((weak));
extern int __io_getchar(void) __attribute__((weak));
register char * stack_ptr asm("sp");
char *__env[1] = { 0 };
char **environ = __env;
/* Functions */
void initialise_monitor_handles() {
}
int _getpid(void) {
return 1;
}
int _kill(int pid, int sig) {
errno = EINVAL;
return -1;
}
void _exit(int status) {
_kill(status, -1);
while (1) {
} /* Make sure we hang here */
}
__attribute__((weak)) int _read(int file, char *ptr, int len) {
int DataIdx;
for (DataIdx = 0; DataIdx < len; DataIdx++) {
*ptr++ = __io_getchar();
}
return len;
}
__attribute__((weak)) int _write(int file, char *ptr, int len) {
int DataIdx;
for (DataIdx = 0; DataIdx < len; DataIdx++) {
__io_putchar(*ptr++);
}
return len;
}
caddr_t _sbrk(int incr) {
extern char end asm("end");
static char *heap_end;
char *prev_heap_end;
if (heap_end == 0) heap_end = &end;
prev_heap_end = heap_end;
if (heap_end + incr > stack_ptr) {
// write(1, "Heap and stack collision\n", 25);
// abort();
errno = ENOMEM;
return (caddr_t) -1;
}
heap_end += incr;
return (caddr_t) prev_heap_end;
}
int _close(int file) {
return -1;
}
int _fstat(int file, struct stat *st) {
st->st_mode = S_IFCHR;
return 0;
}
int _isatty(int file) {
return 1;
}
int _lseek(int file, int ptr, int dir) {
return 0;
}
int _open(char *path, int flags, ...) {
/* Pretend like we always fail */
return -1;
}
int _wait(int *status) {
errno = ECHILD;
return -1;
}
int _unlink(char *name) {
errno = ENOENT;
return -1;
}
int _times(struct tms *buf) {
return -1;
}
int _stat(char *file, struct stat *st) {
st->st_mode = S_IFCHR;
return 0;
}
int _link(char *old, char *new) {
errno = EMLINK;
return -1;
}
int _fork(void) {
errno = EAGAIN;
return -1;
}
int _execve(char *name, char **argv, char **env) {
errno = ENOMEM;
return -1;
}
|
the_stack_data/92909.c | int do_it(int n) {
return n % 2;
}
int main() {
int tmp = do_it(5);
print_int(tmp);
return 0;
}
|
the_stack_data/232851.c | /* Default definition for ARGP_PROGRAM_BUG_ADDRESS.
Copyright (C) 1996-2020 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Written by Miles Bader <[email protected]>.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<https://www.gnu.org/licenses/>. */
/* If set by the user program, it should point to string that is the
bug-reporting address for the program. It will be printed by argp_help if
the ARGP_HELP_BUG_ADDR flag is set (as it is by various standard help
messages), embedded in a sentence that says something like `Report bugs to
ADDR.'. */
const char *argp_program_bug_address;
|
the_stack_data/807360.c | /*
* Copyright (c) 2020 Friedt Professional Engineering Services, Inc
*
* SPDX-License-Identifier: Apache-2.0
*/
#if defined(__ZEPHYR__) && !(defined(CONFIG_BOARD_NATIVE_POSIX_32BIT) \
|| defined(CONFIG_BOARD_NATIVE_POSIX_64BIT) \
|| defined(CONFIG_SOC_SERIES_BSIM_NRFXX))
#include <net/socket.h>
#include <posix/pthread.h>
#include <sys/util.h>
#include <posix/unistd.h>
#else
#include <poll.h>
#include <pthread.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <unistd.h>
#define ARRAY_SIZE(x) (sizeof(x)/sizeof((x)[0]))
#endif
#include <assert.h>
#include <errno.h>
#include <stdbool.h>
#include <stdio.h>
#include <string.h>
#define NUM_SOCKETPAIRS 3
#define NUM_REPITITIONS 3
struct ctx {
int spair[2];
pthread_t thread;
char *name;
};
static const char *const names[] = {
"Alpha",
"Bravo",
"Charlie",
};
#if defined(__ZEPHYR__) && !(defined(CONFIG_BOARD_NATIVE_POSIX_32BIT) \
|| defined(CONFIG_BOARD_NATIVE_POSIX_64BIT) \
|| defined(CONFIG_SOC_SERIES_BSIM_NRFXX))
#define STACK_SIZE (1024 + CONFIG_TEST_EXTRA_STACKSIZE)
static pthread_attr_t attr[NUM_SOCKETPAIRS];
K_THREAD_STACK_ARRAY_DEFINE(stack, NUM_SOCKETPAIRS, STACK_SIZE);
#endif
static void hello(int fd, const char *name)
{
/* write(2) should be used after #25443 */
int res = send(fd, name, strlen(name), 0);
if (res != strlen(name)) {
printf("%s(): send: expected: %d actual: %d errno: %d\n",
__func__, (int)strlen(name), res, errno);
}
}
static void *fun(void *arg)
{
struct ctx *const ctx = (struct ctx *)arg;
int fd = ctx->spair[1];
const char *name = ctx->name;
for (size_t i = 0; i < NUM_REPITITIONS; ++i) {
hello(fd, name);
}
close(fd);
printf("%s closed fd %d\n", name, fd);
ctx->spair[1] = -1;
return NULL;
}
static int fd_to_idx(int fd, struct ctx *ctx, size_t n)
{
int r = -1;
size_t i;
for (i = 0; i < n; ++i) {
if (ctx[i].spair[0] == fd) {
r = i;
break;
}
}
return r;
}
#ifdef __ZEPHYR__
void zephyr_app_main(void)
{
#else
int main(int argc, char *argv[])
{
(void) argc;
(void) argv;
#endif
int r;
int fd;
int idx;
int poll_r;
size_t i;
size_t num_active;
char buf[32];
struct ctx ctx[NUM_SOCKETPAIRS] = {};
struct pollfd fds[NUM_SOCKETPAIRS] = {};
void *unused;
pthread_attr_t *attrp = NULL;
for (i = 0; i < ARRAY_SIZE(ctx); ++i) {
ctx[i].name = (char *)names[i];
r = socketpair(AF_UNIX, SOCK_STREAM, 0, ctx[i].spair);
if (r != 0) {
printf("socketpair failed: %d\n", errno);
goto out;
}
#if defined(__ZEPHYR__) && !(defined(CONFIG_BOARD_NATIVE_POSIX_32BIT) \
|| defined(CONFIG_BOARD_NATIVE_POSIX_64BIT) \
|| defined(CONFIG_SOC_SERIES_BSIM_NRFXX))
/* Zephyr requires a non-NULL attribute for pthread_create */
attrp = &attr[i];
r = pthread_attr_init(attrp);
if (r != 0) {
printf("pthread_attr_init() failed: %d", r);
goto out;
}
r = pthread_attr_setstack(attrp, &stack[i], STACK_SIZE);
if (r != 0) {
printf("pthread_attr_setstack() failed: %d", r);
goto out;
}
#endif
r = pthread_create(&ctx[i].thread, attrp, fun, &ctx[i]);
if (r != 0) {
printf("pthread_create failed: %d\n", r);
goto out;
}
printf("%s: socketpair: %d <=> %d\n",
ctx[i].name, ctx[i].spair[0], ctx[i].spair[1]);
}
/* loop until all threads are done */
for (;;) {
/* count threads that are still running and fill in pollfds */
for (i = 0, num_active = 0; i < ARRAY_SIZE(ctx); ++i) {
if (ctx[i].spair[0] == -1) {
continue;
}
fds[num_active].fd = ctx[i].spair[0];
fds[num_active].events = POLLIN;
fds[num_active].revents = 0;
num_active++;
}
if (num_active == 0) {
/* all threads are done */
break;
}
poll_r = poll(fds, num_active, -1);
for (size_t i = 0; i < num_active; ++i) {
fd = fds[i].fd;
idx = fd_to_idx(fd, ctx, ARRAY_SIZE(ctx));
if (idx < 0) {
printf("failed to map fd %d to index\n", fd);
continue;
}
if ((fds[i].revents & POLLIN) != 0) {
memset(buf, '\0', sizeof(buf));
/* read(2) should be used after #25443 */
r = recv(fd, buf, sizeof(buf), 0);
printf("fd: %d: read %d bytes\n", fd, r);
}
if ((fds[i].revents & POLLERR) != 0) {
printf("fd: %d: error\n", fd);
}
if ((fds[i].revents & POLLHUP) != 0) {
printf("fd: %d: hung up\n", fd);
close(ctx[idx].spair[0]);
printf("%s: closed fd %d\n", __func__,
ctx[idx].spair[0]);
pthread_join(ctx[idx].thread, &unused);
printf("joined %s\n", ctx[idx].name);
ctx[idx].spair[0] = -1;
}
}
}
printf("finished!\n");
out:
#ifndef __ZEPHYR__
return 0;
#else
return;
#endif
}
|
the_stack_data/45449495.c | // MIT License
// Copyright (c) [2017] [Vinay Yuvashankar]
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#include <stdlib.h>
#include <stdio.h>
int num_odd,num_regular;
int num_res_reg_right,num_res_reg_wrong, num_res_odd_right,num_res_odd_wrong;
int mode; //mode is 1 for regular, 2 for odd
int last_presented; // (1 for regular, 2 for odd);
int responded; // We only allow one response to a stimulus
int num_since_odd;
float time;
long val1;
long val2;
float last_time;
float av_reg_res_time_right;
float av_reg_res_time_wrong;
float av_odd_res_time_right;
float av_odd_res_time_wrong;
int read_trigger(FILE* in_file)
{
int ret_code;
ret_code=fscanf(in_file,"%f",&time);
ret_code=fscanf(in_file,"%ld",&val1);
ret_code=fscanf(in_file,"%ld",&val2);
return(ret_code);
}
int process_file(FILE* in_file, FILE* out_file)
{
int ret_code=1;
char buff[64];
int code,button;
// Rad the first 3 lines, they are nto important for us
fgets(buff,64,in_file);
fgets(buff,64,in_file);
fgets(buff,64,in_file);
//Now line by line 3 numbers in each
while(ret_code==1){
ret_code=read_trigger(in_file);
// Check, there could be a --- in the last collunm
if(ret_code==0){
printf("ERROR \n");
exit(0);
}else{
code = val2 & 255;
button=(val2 >>8)&3;
if((code==1) && (mode==0)){
num_regular++;
mode=1;
last_presented=1;
last_time=time;
responded=0;
if(num_since_odd!=-1) num_since_odd++;
fprintf(out_file,"\n %d\t REGULAR\t %d \t ",
num_odd+num_regular, num_since_odd);
}
if((code==2) && (mode==0)){
num_odd++;
mode=2;
last_presented=2;
last_time=time;
responded=0;
num_since_odd=0;
fprintf(out_file,"\n %d \t ODD \t %d \t ",
num_odd+num_regular, num_since_odd);
}
if(code==0){
mode=0;
}
// NOW WE CHECK THE BUTTONS
if((button==1) && (responded==0)){
responded=1;
if(last_presented==1){
num_res_reg_right++;
float r_t=time-last_time;
av_reg_res_time_right+=r_t;
fprintf(out_file," RIGHT \t %f ",r_t);
}
if(last_presented==2){
num_res_odd_wrong++;
float r_t=time-last_time;
av_odd_res_time_wrong+=r_t;
fprintf(out_file," WRONG \t %f ",r_t);
}
}
if((button==2) && (responded==0)){
responded=1;
if(last_presented==1){
num_res_reg_wrong++;
float r_t=time-last_time;
av_reg_res_time_wrong+=r_t;
fprintf(out_file," WRONG \t %f ",r_t);
}
if(last_presented==2){
num_res_odd_right++;
float r_t=time-last_time;
av_odd_res_time_right+=r_t;
fprintf(out_file," RIGHT \t %f",r_t);
}
}
//fprintf(out_file," %d ",val2);
//fprintf(out_file," Condition %d Button %d \n",code,button);
}
}
printf("There were %d experiments, %d regular %d odd \n",
num_regular+num_odd,num_regular,num_odd);
printf("Responses \n");
printf("Regular %d right %d wrong \n",num_res_reg_right,num_res_reg_wrong);
printf("Odd %d right %d wrong \n",num_res_odd_right,num_res_odd_wrong);
printf("Response Times \n");
printf("Regular average time right %f wrong %f \n",
av_reg_res_time_right/((float)(num_res_reg_right)),
av_reg_res_time_wrong/((float)(num_res_reg_wrong)));
printf("Odd average time: right %f wrong %f \n",
av_odd_res_time_right/((float)(num_res_odd_right)),
av_odd_res_time_wrong/((float)(num_res_odd_wrong)));
return(0);
}
int main(int nargs, char* args[])
{
FILE * filter_file;
FILE* in_file;
FILE* out_file;
if(nargs!=3){
printf("Usage: %s input_file.trg out_file \n",args[0]);
return(1);
}
in_file=fopen(args[1],"r");
if(in_file==NULL){
printf("ERROR: input_file %s does not exist \n",args[1]);
return(1);
}
out_file=fopen(args[2],"w");
if(out_file==NULL){
printf("ERROR: input_file %s does not exist \n",args[2]);
return(1);
}
//Initialize Gloabls
num_odd=0;
num_regular=0;
num_res_reg_right=0;
num_res_reg_wrong=0;
num_res_odd_right=0;
num_res_odd_wrong=0;
last_presented=0;
responded=0;
num_since_odd=-1;
last_time=0.;
av_reg_res_time_right=0.;
av_reg_res_time_wrong=0.;
av_odd_res_time_right=0.;
av_odd_res_time_wrong=0.;
printf(" \n Start Processing file: %s \n",args[1]);
process_file(in_file,out_file);
fclose(in_file);
fclose(out_file);
return(0);
}
|
the_stack_data/151707040.c | // Binary Search Program - Iterative
#include <stdio.h>
void readArr(int[],int);
int BinSearch(int[],int,int,int);
void main()
{
int A[20],n,key,i,x;
printf("Enter the number of elements: ");
scanf("%d",&n);
readArr(A,n);
printf("Enter the element to search: ");
scanf("%d",&key);
x=BinSearch(A,0,n-1,key);
if(x==-1)
printf("Element not found");
else
printf("Element found at position %d",x+1);
}
void readArr(int A[],int n)
{
int i;
printf("Enter %d number of elements: ",n);
for(i=0;i<n;i++)
scanf("%d",&A[i]);
}
int BinSearch(int A[],int lwr,int upr,int key)
{
int mid;
while(lwr<=upr)
{
mid=(lwr+upr)/2;
if(A[mid]==key)
return mid;
else if(A[mid]<key)
lwr=mid+1;
else
upr=mid-1;
}
return -1;
}
|
the_stack_data/181392483.c | // autogenerated by syzkaller (https://github.com/google/syzkaller)
#define _GNU_SOURCE
#include <endian.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/syscall.h>
#include <sys/types.h>
#include <unistd.h>
uint64_t r[2] = {0xffffffffffffffff, 0xffffffffffffffff};
int main(void)
{
syscall(__NR_mmap, 0x20000000ul, 0x1000000ul, 3ul, 0x32ul, -1, 0);
intptr_t res = 0;
res = syscall(__NR_socket, 0x10ul, 3ul, 0x14ul);
if (res != -1)
r[0] = res;
*(uint64_t*)0x200031c0 = 0;
*(uint32_t*)0x200031c8 = 0;
*(uint64_t*)0x200031d0 = 0x20003180;
*(uint64_t*)0x20003180 = 0x20003000;
*(uint32_t*)0x20003000 = 0x38;
*(uint16_t*)0x20003004 = 0x1403;
*(uint16_t*)0x20003006 = 1;
*(uint32_t*)0x20003008 = 0;
*(uint32_t*)0x2000300c = 0;
*(uint16_t*)0x20003010 = 9;
*(uint16_t*)0x20003012 = 2;
memcpy((void*)0x20003014, "syz1\000", 5);
*(uint16_t*)0x2000301c = 8;
*(uint16_t*)0x2000301e = 0x41;
memcpy((void*)0x20003020, "siw\000", 4);
*(uint16_t*)0x20003024 = 0x14;
*(uint16_t*)0x20003026 = 0x33;
memcpy((void*)0x20003028,
"lo\000\000\000\000\000\000\000\000\000\000\000\000\000\000", 16);
*(uint64_t*)0x20003188 = 0x38;
*(uint64_t*)0x200031d8 = 1;
*(uint64_t*)0x200031e0 = 0;
*(uint64_t*)0x200031e8 = 0;
*(uint32_t*)0x200031f0 = 0;
syscall(__NR_sendmsg, r[0], 0x200031c0ul, 0ul);
res = syscall(__NR_socket, 0x10ul, 3ul, 0x14ul);
if (res != -1)
r[1] = res;
*(uint64_t*)0x20000240 = 0;
*(uint32_t*)0x20000248 = 0;
*(uint64_t*)0x20000250 = 0x20000200;
*(uint64_t*)0x20000200 = 0x20000180;
*(uint32_t*)0x20000180 = 0x30;
*(uint16_t*)0x20000184 = 0x1410;
*(uint16_t*)0x20000186 = 1;
*(uint32_t*)0x20000188 = 0;
*(uint32_t*)0x2000018c = 0;
*(uint16_t*)0x20000190 = 8;
*(uint16_t*)0x20000192 = 0x4b;
*(uint32_t*)0x20000194 = 0x13;
*(uint16_t*)0x20000198 = 8;
*(uint16_t*)0x2000019a = 0x4a;
*(uint32_t*)0x2000019c = 0;
*(uint16_t*)0x200001a0 = 8;
*(uint16_t*)0x200001a2 = 1;
*(uint32_t*)0x200001a4 = 0;
*(uint16_t*)0x200001a8 = 8;
*(uint16_t*)0x200001aa = 3;
*(uint32_t*)0x200001ac = 1;
*(uint64_t*)0x20000208 = 0x30;
*(uint64_t*)0x20000258 = 1;
*(uint64_t*)0x20000260 = 0;
*(uint64_t*)0x20000268 = 0;
*(uint32_t*)0x20000270 = 0x20000021;
syscall(__NR_sendmsg, r[1], 0x20000240ul, 0ul);
return 0;
}
|
the_stack_data/11075848.c | /*Write a function called intToStr() that converts an integer value into a character string. Be certain the function handles negative integers properly.*/
#include <stdio.h>
int absValue (int intValue)
{
if ( intValue < 0 ) {
intValue *= -1;
}
return intValue;
}
void intToStr (int intValue, char intString[])
{
int magnitude = absValue(intValue), sign, i;
if ( intValue < 0 ) {
sign = -1;
i = 1;
intString[0] = '-';
} else {
sign = 1;
i = 0;
}
while ( magnitude / 10 > 0 ) {
++i;
magnitude /= 10;
}
intString[i + 1] = '\0';
magnitude = absValue(intValue);
for ( int n = (sign < 0) ? 1 : 0; i >= n; --i ) {
intString[i] = (magnitude % 10) + '0';
magnitude /= 10;
}
}
int main (void)
{
char intString[20] = { '\0' };
for ( int intValue = 321; intValue > -321; intValue -= 87 ) {
printf ("%i\n", intValue);
intToStr (intValue, intString);
printf ("\"%s\"\n\n", intString);
}
return 0;
} |
the_stack_data/198581440.c | #include <unistd.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <sys/mman.h>
#include <errno.h>
#include <semaphore.h>
#include <pthread.h>
/*
* esempio di accessi concorrenti ad una variabile condivisa
* gestiti attraverso mutex (mutual exclusion)
*
* http://greenteapress.com/semaphores/LittleBookOfSemaphores.pdf
* 1.5.2 Concurrent updates pag. 5
* 3.4 Mutex pag. 16
*
* due threads operano in modo concorrente sulla stessa variabile condivisa,
* un thread la incrementa NUMBER_OF_CYCLES volte
* e l'altro thread la decrementa NUMBER_OF_CYCLES volte.
*
* lo schema di mutua esclusione (mutex) per gestire l'accesso concorrente alla variabile condivisa
* è realizzato con semaforo POSIX senza nome.
*
* il mutex garantisce che soltanto un thread alla volta acceda alla variabile condivisa.
*
*
* vedere anche l'esempio 007.07mmap-sem
*/
sem_t * process_semaphore;
int shared_counter; // variabile condivisa tra i due thread
// esercizio:
// nei due thread t1 e t2, tenere traccia del valore max e valore minimo assunto da shared_counter
// e scriverlo prima di terminare
#define CHECK_ERR(a,msg) {if ((a) == -1) { perror((msg)); exit(EXIT_FAILURE); } }
#define NUMBER_OF_CYCLES 10000000
void * thread_function_1(void * arg) {
for (int i = 0; i < NUMBER_OF_CYCLES; i++) {
// 3.4.2 Mutual exclusion solution, pag. 19
if (sem_wait(process_semaphore) == -1) {
perror("sem_wait");
exit(EXIT_FAILURE);
}
shared_counter++;
if (sem_post(process_semaphore) == -1) {
perror("sem_post");
exit(EXIT_FAILURE);
}
}
return NULL;
}
void * thread_function_2(void * arg) {
for (int i = 0; i < NUMBER_OF_CYCLES; i++) {
// 3.4.2 Mutual exclusion solution, pag. 19
if (sem_wait(process_semaphore) == -1) {
perror("sem_wait");
exit(EXIT_FAILURE);
}
shared_counter--;
if (sem_post(process_semaphore) == -1) {
perror("sem_post");
exit(EXIT_FAILURE);
}
}
return NULL;
}
int main(int argc, char * argv[]) {
pthread_t t1;
pthread_t t2;
void * res;
int s;
struct timespec ts1, ts2;
printf("initial value of shared_counter=%d, NUMBER_OF_CYCLES=%d\n", shared_counter, NUMBER_OF_CYCLES);
process_semaphore = malloc(sizeof(sem_t));
s = sem_init(process_semaphore,
0, // 1 => il semaforo è condiviso tra processi,
// 0 => il semaforo è condiviso tra threads del processo
1 // valore iniziale del semaforo (se mettiamo 0 che succede?)
);
CHECK_ERR(s,"sem_init")
clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &ts1);
s = pthread_create(&t1, NULL, thread_function_1, NULL);
if (s != 0) {
perror("pthread_create");
exit(EXIT_FAILURE);
}
s = pthread_create(&t2, NULL, thread_function_2, NULL);
if (s != 0) {
perror("pthread_create");
exit(EXIT_FAILURE);
}
s = pthread_join(t1, &res);
if (s != 0) {
perror("pthread_join");
exit(EXIT_FAILURE);
}
s = pthread_join(t2, &res);
if (s != 0) {
perror("pthread_join");
exit(EXIT_FAILURE);
}
clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &ts2);
printf("final value of shared_counter=%d\n", shared_counter);
//printf("%ld %ld\n", ts1.tv_sec, ts1.tv_nsec);
//printf("%ld %ld\n", ts2.tv_sec, ts2.tv_nsec);
long dt = ((ts2.tv_sec - ts1.tv_sec) * 1000000000L + ts2.tv_nsec) - ts1.tv_nsec;
printf("clock_gettime(CLOCK_PROCESS_CPUTIME_ID): dt = %ld ns\n", dt);
printf("dt/NUMBER_OF_CYCLES/2 = %ld ns\n", dt/NUMBER_OF_CYCLES/2);
// il semaforo senza nome va distrutto solo quando non ci sono processi bloccati su di esso
s = sem_destroy(process_semaphore);
CHECK_ERR(s,"sem_destroy")
printf("bye\n");
return 0;
}
|
the_stack_data/22011905.c | /* Copyright 2002 Free Software Foundation */
/* Make sure the nested extern declaration doesn't conflict with the
non-extern one in the enclosing scope. */
void foo() {
static long bar;
{
extern int bar;
}
}
|
the_stack_data/22007.c | # 1 "benchmarks/ds-01-impl3.c"
# 1 "<built-in>"
# 1 "<command-line>"
# 1 "/usr/include/stdc-predef.h" 1 3 4
# 1 "<command-line>" 2
# 1 "benchmarks/ds-01-impl3.c"
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 1
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h"
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/definitions.h" 1
# 132 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/definitions.h"
int X_SIZE_VALUE = 0;
int overflow_mode = 1;
int rounding_mode = 0;
# 155 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/definitions.h"
typedef struct {
double a[100];
int a_size;
double b[100];
int b_size;
double sample_time;
double a_uncertainty[100];
double b_uncertainty[100];
} digital_system;
typedef struct {
double A[4][4];
double B[4][4];
double C[4][4];
double D[4][4];
double states[4][4];
double outputs[4][4];
double inputs[4][4];
double K[4][4];
unsigned int nStates;
unsigned int nInputs;
unsigned int nOutputs;
} digital_system_state_space;
typedef struct {
int int_bits;
int frac_bits;
double max;
double min;
int default_realization;
double delta;
int scale;
double max_error;
} implementation;
typedef struct {
int push;
int in;
int sbiw;
int cli;
int out;
int std;
int ldd;
int subi;
int sbci;
int lsl;
int rol;
int add;
int adc;
int adiw;
int rjmp;
int mov;
int sbc;
int ld;
int rcall;
int cp;
int cpc;
int ldi;
int brge;
int pop;
int ret;
int st;
int brlt;
int cpi;
} instructions;
typedef struct {
long clock;
int device;
double cycle;
instructions assembly;
} hardware;
typedef struct{
float Ap, Ar, Ac;
float wp, wc, wr;
int type;
}filter_parameters;
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
# 1 "/usr/include/stdlib.h" 1 3 4
# 25 "/usr/include/stdlib.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 1 3 4
# 33 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 3 4
# 1 "/usr/include/features.h" 1 3 4
# 461 "/usr/include/features.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 1 3 4
# 452 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 453 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/long-double.h" 1 3 4
# 454 "/usr/include/x86_64-linux-gnu/sys/cdefs.h" 2 3 4
# 462 "/usr/include/features.h" 2 3 4
# 485 "/usr/include/features.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/gnu/stubs.h" 1 3 4
# 10 "/usr/include/x86_64-linux-gnu/gnu/stubs.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/gnu/stubs-64.h" 1 3 4
# 11 "/usr/include/x86_64-linux-gnu/gnu/stubs.h" 2 3 4
# 486 "/usr/include/features.h" 2 3 4
# 34 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 2 3 4
# 26 "/usr/include/stdlib.h" 2 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 209 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 3 4
# 209 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 3 4
typedef long unsigned int size_t;
# 321 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 3 4
typedef int wchar_t;
# 32 "/usr/include/stdlib.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/waitflags.h" 1 3 4
# 52 "/usr/include/x86_64-linux-gnu/bits/waitflags.h" 3 4
typedef enum
{
P_ALL,
P_PID,
P_PGID
} idtype_t;
# 40 "/usr/include/stdlib.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/waitstatus.h" 1 3 4
# 41 "/usr/include/stdlib.h" 2 3 4
# 55 "/usr/include/stdlib.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/floatn.h" 1 3 4
# 120 "/usr/include/x86_64-linux-gnu/bits/floatn.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/floatn-common.h" 1 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/floatn-common.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/long-double.h" 1 3 4
# 25 "/usr/include/x86_64-linux-gnu/bits/floatn-common.h" 2 3 4
# 121 "/usr/include/x86_64-linux-gnu/bits/floatn.h" 2 3 4
# 56 "/usr/include/stdlib.h" 2 3 4
typedef struct
{
int quot;
int rem;
} div_t;
typedef struct
{
long int quot;
long int rem;
} ldiv_t;
__extension__ typedef struct
{
long long int quot;
long long int rem;
} lldiv_t;
# 97 "/usr/include/stdlib.h" 3 4
extern size_t __ctype_get_mb_cur_max (void) __attribute__ ((__nothrow__ , __leaf__)) ;
extern double atof (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
extern int atoi (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
extern long int atol (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
__extension__ extern long long int atoll (const char *__nptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
extern double strtod (const char *__restrict __nptr,
char **__restrict __endptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern float strtof (const char *__restrict __nptr,
char **__restrict __endptr) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern long double strtold (const char *__restrict __nptr,
char **__restrict __endptr)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 176 "/usr/include/stdlib.h" 3 4
extern long int strtol (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern unsigned long int strtoul (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern long long int strtoq (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern unsigned long long int strtouq (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern long long int strtoll (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
__extension__
extern unsigned long long int strtoull (const char *__restrict __nptr,
char **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 385 "/usr/include/stdlib.h" 3 4
extern char *l64a (long int __n) __attribute__ ((__nothrow__ , __leaf__)) ;
extern long int a64l (const char *__s)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ;
# 1 "/usr/include/x86_64-linux-gnu/sys/types.h" 1 3 4
# 27 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types.h" 1 3 4
# 27 "/usr/include/x86_64-linux-gnu/bits/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 28 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/timesize.h" 1 3 4
# 29 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
typedef unsigned char __u_char;
typedef unsigned short int __u_short;
typedef unsigned int __u_int;
typedef unsigned long int __u_long;
typedef signed char __int8_t;
typedef unsigned char __uint8_t;
typedef signed short int __int16_t;
typedef unsigned short int __uint16_t;
typedef signed int __int32_t;
typedef unsigned int __uint32_t;
typedef signed long int __int64_t;
typedef unsigned long int __uint64_t;
typedef __int8_t __int_least8_t;
typedef __uint8_t __uint_least8_t;
typedef __int16_t __int_least16_t;
typedef __uint16_t __uint_least16_t;
typedef __int32_t __int_least32_t;
typedef __uint32_t __uint_least32_t;
typedef __int64_t __int_least64_t;
typedef __uint64_t __uint_least64_t;
typedef long int __quad_t;
typedef unsigned long int __u_quad_t;
typedef long int __intmax_t;
typedef unsigned long int __uintmax_t;
# 141 "/usr/include/x86_64-linux-gnu/bits/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/typesizes.h" 1 3 4
# 142 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/time64.h" 1 3 4
# 143 "/usr/include/x86_64-linux-gnu/bits/types.h" 2 3 4
typedef unsigned long int __dev_t;
typedef unsigned int __uid_t;
typedef unsigned int __gid_t;
typedef unsigned long int __ino_t;
typedef unsigned long int __ino64_t;
typedef unsigned int __mode_t;
typedef unsigned long int __nlink_t;
typedef long int __off_t;
typedef long int __off64_t;
typedef int __pid_t;
typedef struct { int __val[2]; } __fsid_t;
typedef long int __clock_t;
typedef unsigned long int __rlim_t;
typedef unsigned long int __rlim64_t;
typedef unsigned int __id_t;
typedef long int __time_t;
typedef unsigned int __useconds_t;
typedef long int __suseconds_t;
typedef int __daddr_t;
typedef int __key_t;
typedef int __clockid_t;
typedef void * __timer_t;
typedef long int __blksize_t;
typedef long int __blkcnt_t;
typedef long int __blkcnt64_t;
typedef unsigned long int __fsblkcnt_t;
typedef unsigned long int __fsblkcnt64_t;
typedef unsigned long int __fsfilcnt_t;
typedef unsigned long int __fsfilcnt64_t;
typedef long int __fsword_t;
typedef long int __ssize_t;
typedef long int __syscall_slong_t;
typedef unsigned long int __syscall_ulong_t;
typedef __off64_t __loff_t;
typedef char *__caddr_t;
typedef long int __intptr_t;
typedef unsigned int __socklen_t;
typedef int __sig_atomic_t;
# 30 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef __u_char u_char;
typedef __u_short u_short;
typedef __u_int u_int;
typedef __u_long u_long;
typedef __quad_t quad_t;
typedef __u_quad_t u_quad_t;
typedef __fsid_t fsid_t;
typedef __loff_t loff_t;
typedef __ino_t ino_t;
# 59 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
typedef __dev_t dev_t;
typedef __gid_t gid_t;
typedef __mode_t mode_t;
typedef __nlink_t nlink_t;
typedef __uid_t uid_t;
typedef __off_t off_t;
# 97 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
typedef __pid_t pid_t;
typedef __id_t id_t;
typedef __ssize_t ssize_t;
typedef __daddr_t daddr_t;
typedef __caddr_t caddr_t;
typedef __key_t key_t;
# 1 "/usr/include/x86_64-linux-gnu/bits/types/clock_t.h" 1 3 4
typedef __clock_t clock_t;
# 127 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/clockid_t.h" 1 3 4
typedef __clockid_t clockid_t;
# 129 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/time_t.h" 1 3 4
typedef __time_t time_t;
# 130 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/timer_t.h" 1 3 4
typedef __timer_t timer_t;
# 131 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 144 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 145 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef unsigned long int ulong;
typedef unsigned short int ushort;
typedef unsigned int uint;
# 1 "/usr/include/x86_64-linux-gnu/bits/stdint-intn.h" 1 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/stdint-intn.h" 3 4
typedef __int8_t int8_t;
typedef __int16_t int16_t;
typedef __int32_t int32_t;
typedef __int64_t int64_t;
# 156 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef __uint8_t u_int8_t;
typedef __uint16_t u_int16_t;
typedef __uint32_t u_int32_t;
typedef __uint64_t u_int64_t;
typedef int register_t __attribute__ ((__mode__ (__word__)));
# 176 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/include/endian.h" 1 3 4
# 24 "/usr/include/endian.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/endian.h" 1 3 4
# 35 "/usr/include/x86_64-linux-gnu/bits/endian.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/endianness.h" 1 3 4
# 36 "/usr/include/x86_64-linux-gnu/bits/endian.h" 2 3 4
# 25 "/usr/include/endian.h" 2 3 4
# 35 "/usr/include/endian.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/byteswap.h" 1 3 4
# 33 "/usr/include/x86_64-linux-gnu/bits/byteswap.h" 3 4
static __inline __uint16_t
__bswap_16 (__uint16_t __bsx)
{
return __builtin_bswap16 (__bsx);
}
static __inline __uint32_t
__bswap_32 (__uint32_t __bsx)
{
return __builtin_bswap32 (__bsx);
}
# 69 "/usr/include/x86_64-linux-gnu/bits/byteswap.h" 3 4
__extension__ static __inline __uint64_t
__bswap_64 (__uint64_t __bsx)
{
return __builtin_bswap64 (__bsx);
}
# 36 "/usr/include/endian.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/uintn-identity.h" 1 3 4
# 32 "/usr/include/x86_64-linux-gnu/bits/uintn-identity.h" 3 4
static __inline __uint16_t
__uint16_identity (__uint16_t __x)
{
return __x;
}
static __inline __uint32_t
__uint32_identity (__uint32_t __x)
{
return __x;
}
static __inline __uint64_t
__uint64_identity (__uint64_t __x)
{
return __x;
}
# 37 "/usr/include/endian.h" 2 3 4
# 177 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/sys/select.h" 1 3 4
# 30 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/select.h" 1 3 4
# 22 "/usr/include/x86_64-linux-gnu/bits/select.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 23 "/usr/include/x86_64-linux-gnu/bits/select.h" 2 3 4
# 31 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/sigset_t.h" 1 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__sigset_t.h" 1 3 4
typedef struct
{
unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))];
} __sigset_t;
# 5 "/usr/include/x86_64-linux-gnu/bits/types/sigset_t.h" 2 3 4
typedef __sigset_t sigset_t;
# 34 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/struct_timeval.h" 1 3 4
struct timeval
{
__time_t tv_sec;
__suseconds_t tv_usec;
};
# 38 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/struct_timespec.h" 1 3 4
# 10 "/usr/include/x86_64-linux-gnu/bits/types/struct_timespec.h" 3 4
struct timespec
{
__time_t tv_sec;
__syscall_slong_t tv_nsec;
# 26 "/usr/include/x86_64-linux-gnu/bits/types/struct_timespec.h" 3 4
};
# 40 "/usr/include/x86_64-linux-gnu/sys/select.h" 2 3 4
typedef __suseconds_t suseconds_t;
typedef long int __fd_mask;
# 59 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
typedef struct
{
__fd_mask __fds_bits[1024 / (8 * (int) sizeof (__fd_mask))];
} fd_set;
typedef __fd_mask fd_mask;
# 91 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
# 101 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
extern int select (int __nfds, fd_set *__restrict __readfds,
fd_set *__restrict __writefds,
fd_set *__restrict __exceptfds,
struct timeval *__restrict __timeout);
# 113 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
extern int pselect (int __nfds, fd_set *__restrict __readfds,
fd_set *__restrict __writefds,
fd_set *__restrict __exceptfds,
const struct timespec *__restrict __timeout,
const __sigset_t *__restrict __sigmask);
# 126 "/usr/include/x86_64-linux-gnu/sys/select.h" 3 4
# 180 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
typedef __blksize_t blksize_t;
typedef __blkcnt_t blkcnt_t;
typedef __fsblkcnt_t fsblkcnt_t;
typedef __fsfilcnt_t fsfilcnt_t;
# 227 "/usr/include/x86_64-linux-gnu/sys/types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes.h" 1 3 4
# 23 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 1 3 4
# 44 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes-arch.h" 1 3 4
# 21 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes-arch.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 22 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes-arch.h" 2 3 4
# 45 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 2 3 4
typedef struct __pthread_internal_list
{
struct __pthread_internal_list *__prev;
struct __pthread_internal_list *__next;
} __pthread_list_t;
typedef struct __pthread_internal_slist
{
struct __pthread_internal_slist *__next;
} __pthread_slist_t;
# 74 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/struct_mutex.h" 1 3 4
# 22 "/usr/include/x86_64-linux-gnu/bits/struct_mutex.h" 3 4
struct __pthread_mutex_s
{
int __lock;
unsigned int __count;
int __owner;
unsigned int __nusers;
int __kind;
short __spins;
short __elision;
__pthread_list_t __list;
# 53 "/usr/include/x86_64-linux-gnu/bits/struct_mutex.h" 3 4
};
# 75 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 2 3 4
# 87 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/struct_rwlock.h" 1 3 4
# 23 "/usr/include/x86_64-linux-gnu/bits/struct_rwlock.h" 3 4
struct __pthread_rwlock_arch_t
{
unsigned int __readers;
unsigned int __writers;
unsigned int __wrphase_futex;
unsigned int __writers_futex;
unsigned int __pad3;
unsigned int __pad4;
int __cur_writer;
int __shared;
signed char __rwelision;
unsigned char __pad1[7];
unsigned long int __pad2;
unsigned int __flags;
# 55 "/usr/include/x86_64-linux-gnu/bits/struct_rwlock.h" 3 4
};
# 88 "/usr/include/x86_64-linux-gnu/bits/thread-shared-types.h" 2 3 4
struct __pthread_cond_s
{
__extension__ union
{
__extension__ unsigned long long int __wseq;
struct
{
unsigned int __low;
unsigned int __high;
} __wseq32;
};
__extension__ union
{
__extension__ unsigned long long int __g1_start;
struct
{
unsigned int __low;
unsigned int __high;
} __g1_start32;
};
unsigned int __g_refs[2] ;
unsigned int __g_size[2];
unsigned int __g1_orig_size;
unsigned int __wrefs;
unsigned int __g_signals[2];
};
# 24 "/usr/include/x86_64-linux-gnu/bits/pthreadtypes.h" 2 3 4
typedef unsigned long int pthread_t;
typedef union
{
char __size[4];
int __align;
} pthread_mutexattr_t;
typedef union
{
char __size[4];
int __align;
} pthread_condattr_t;
typedef unsigned int pthread_key_t;
typedef int pthread_once_t;
union pthread_attr_t
{
char __size[56];
long int __align;
};
typedef union pthread_attr_t pthread_attr_t;
typedef union
{
struct __pthread_mutex_s __data;
char __size[40];
long int __align;
} pthread_mutex_t;
typedef union
{
struct __pthread_cond_s __data;
char __size[48];
__extension__ long long int __align;
} pthread_cond_t;
typedef union
{
struct __pthread_rwlock_arch_t __data;
char __size[56];
long int __align;
} pthread_rwlock_t;
typedef union
{
char __size[8];
long int __align;
} pthread_rwlockattr_t;
typedef volatile int pthread_spinlock_t;
typedef union
{
char __size[32];
long int __align;
} pthread_barrier_t;
typedef union
{
char __size[4];
int __align;
} pthread_barrierattr_t;
# 228 "/usr/include/x86_64-linux-gnu/sys/types.h" 2 3 4
# 395 "/usr/include/stdlib.h" 2 3 4
extern long int random (void) __attribute__ ((__nothrow__ , __leaf__));
extern void srandom (unsigned int __seed) __attribute__ ((__nothrow__ , __leaf__));
extern char *initstate (unsigned int __seed, char *__statebuf,
size_t __statelen) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern char *setstate (char *__statebuf) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
struct random_data
{
int32_t *fptr;
int32_t *rptr;
int32_t *state;
int rand_type;
int rand_deg;
int rand_sep;
int32_t *end_ptr;
};
extern int random_r (struct random_data *__restrict __buf,
int32_t *__restrict __result) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int srandom_r (unsigned int __seed, struct random_data *__buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern int initstate_r (unsigned int __seed, char *__restrict __statebuf,
size_t __statelen,
struct random_data *__restrict __buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2, 4)));
extern int setstate_r (char *__restrict __statebuf,
struct random_data *__restrict __buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int rand (void) __attribute__ ((__nothrow__ , __leaf__));
extern void srand (unsigned int __seed) __attribute__ ((__nothrow__ , __leaf__));
extern int rand_r (unsigned int *__seed) __attribute__ ((__nothrow__ , __leaf__));
extern double drand48 (void) __attribute__ ((__nothrow__ , __leaf__));
extern double erand48 (unsigned short int __xsubi[3]) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern long int lrand48 (void) __attribute__ ((__nothrow__ , __leaf__));
extern long int nrand48 (unsigned short int __xsubi[3])
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern long int mrand48 (void) __attribute__ ((__nothrow__ , __leaf__));
extern long int jrand48 (unsigned short int __xsubi[3])
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern void srand48 (long int __seedval) __attribute__ ((__nothrow__ , __leaf__));
extern unsigned short int *seed48 (unsigned short int __seed16v[3])
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern void lcong48 (unsigned short int __param[7]) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
struct drand48_data
{
unsigned short int __x[3];
unsigned short int __old_x[3];
unsigned short int __c;
unsigned short int __init;
__extension__ unsigned long long int __a;
};
extern int drand48_r (struct drand48_data *__restrict __buffer,
double *__restrict __result) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int erand48_r (unsigned short int __xsubi[3],
struct drand48_data *__restrict __buffer,
double *__restrict __result) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int lrand48_r (struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int nrand48_r (unsigned short int __xsubi[3],
struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int mrand48_r (struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int jrand48_r (unsigned short int __xsubi[3],
struct drand48_data *__restrict __buffer,
long int *__restrict __result)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int srand48_r (long int __seedval, struct drand48_data *__buffer)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern int seed48_r (unsigned short int __seed16v[3],
struct drand48_data *__buffer) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern int lcong48_r (unsigned short int __param[7],
struct drand48_data *__buffer)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2)));
extern void *malloc (size_t __size) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__))
__attribute__ ((__alloc_size__ (1))) ;
extern void *calloc (size_t __nmemb, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__)) __attribute__ ((__alloc_size__ (1, 2))) ;
extern void *realloc (void *__ptr, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__warn_unused_result__)) __attribute__ ((__alloc_size__ (2)));
extern void *reallocarray (void *__ptr, size_t __nmemb, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__warn_unused_result__))
__attribute__ ((__alloc_size__ (2, 3)));
extern void free (void *__ptr) __attribute__ ((__nothrow__ , __leaf__));
# 1 "/usr/include/alloca.h" 1 3 4
# 24 "/usr/include/alloca.h" 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 25 "/usr/include/alloca.h" 2 3 4
extern void *alloca (size_t __size) __attribute__ ((__nothrow__ , __leaf__));
# 569 "/usr/include/stdlib.h" 2 3 4
extern void *valloc (size_t __size) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__))
__attribute__ ((__alloc_size__ (1))) ;
extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
extern void *aligned_alloc (size_t __alignment, size_t __size)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__)) __attribute__ ((__alloc_size__ (2))) ;
extern void abort (void) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern int atexit (void (*__func) (void)) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int at_quick_exit (void (*__func) (void)) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int on_exit (void (*__func) (int __status, void *__arg), void *__arg)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern void exit (int __status) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void quick_exit (int __status) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void _Exit (int __status) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern char *getenv (const char *__name) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
# 647 "/usr/include/stdlib.h" 3 4
extern int putenv (char *__string) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int setenv (const char *__name, const char *__value, int __replace)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (2)));
extern int unsetenv (const char *__name) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
extern int clearenv (void) __attribute__ ((__nothrow__ , __leaf__));
# 675 "/usr/include/stdlib.h" 3 4
extern char *mktemp (char *__template) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 688 "/usr/include/stdlib.h" 3 4
extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ;
# 710 "/usr/include/stdlib.h" 3 4
extern int mkstemps (char *__template, int __suffixlen) __attribute__ ((__nonnull__ (1))) ;
# 731 "/usr/include/stdlib.h" 3 4
extern char *mkdtemp (char *__template) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
# 784 "/usr/include/stdlib.h" 3 4
extern int system (const char *__command) ;
# 800 "/usr/include/stdlib.h" 3 4
extern char *realpath (const char *__restrict __name,
char *__restrict __resolved) __attribute__ ((__nothrow__ , __leaf__)) ;
typedef int (*__compar_fn_t) (const void *, const void *);
# 820 "/usr/include/stdlib.h" 3 4
extern void *bsearch (const void *__key, const void *__base,
size_t __nmemb, size_t __size, __compar_fn_t __compar)
__attribute__ ((__nonnull__ (1, 2, 5))) ;
extern void qsort (void *__base, size_t __nmemb, size_t __size,
__compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4)));
# 840 "/usr/include/stdlib.h" 3 4
extern int abs (int __x) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
extern long int labs (long int __x) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
__extension__ extern long long int llabs (long long int __x)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
extern div_t div (int __numer, int __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
extern ldiv_t ldiv (long int __numer, long int __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
__extension__ extern lldiv_t lldiv (long long int __numer,
long long int __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__)) ;
# 872 "/usr/include/stdlib.h" 3 4
extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *gcvt (double __value, int __ndigit, char *__buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3))) ;
extern char *qecvt (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *qfcvt (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4))) ;
extern char *qgcvt (long double __value, int __ndigit, char *__buf)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3))) ;
extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign, char *__restrict __buf,
size_t __len) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt,
int *__restrict __sign, char *__restrict __buf,
size_t __len) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int qecvt_r (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign,
char *__restrict __buf, size_t __len)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int qfcvt_r (long double __value, int __ndigit,
int *__restrict __decpt, int *__restrict __sign,
char *__restrict __buf, size_t __len)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (3, 4, 5)));
extern int mblen (const char *__s, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern int mbtowc (wchar_t *__restrict __pwc,
const char *__restrict __s, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern int wctomb (char *__s, wchar_t __wchar) __attribute__ ((__nothrow__ , __leaf__));
extern size_t mbstowcs (wchar_t *__restrict __pwcs,
const char *__restrict __s, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern size_t wcstombs (char *__restrict __s,
const wchar_t *__restrict __pwcs, size_t __n)
__attribute__ ((__nothrow__ , __leaf__));
extern int rpmatch (const char *__response) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1))) ;
# 957 "/usr/include/stdlib.h" 3 4
extern int getsubopt (char **__restrict __optionp,
char *const *__restrict __tokens,
char **__restrict __valuep)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1, 2, 3))) ;
# 1003 "/usr/include/stdlib.h" 3 4
extern int getloadavg (double __loadavg[], int __nelem)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__nonnull__ (1)));
# 1013 "/usr/include/stdlib.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/stdlib-float.h" 1 3 4
# 1014 "/usr/include/stdlib.h" 2 3 4
# 1023 "/usr/include/stdlib.h" 3 4
# 18 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 2
# 1 "/usr/include/assert.h" 1 3 4
# 66 "/usr/include/assert.h" 3 4
extern void __assert_fail (const char *__assertion, const char *__file,
unsigned int __line, const char *__function)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void __assert_perror_fail (int __errnum, const char *__file,
unsigned int __line, const char *__function)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
extern void __assert (const char *__assertion, const char *__file, int __line)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__noreturn__));
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 2
# 1 "/usr/include/stdio.h" 1 3 4
# 27 "/usr/include/stdio.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 1 3 4
# 28 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stddef.h" 1 3 4
# 34 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdarg.h" 1 3 4
# 40 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdarg.h" 3 4
typedef __builtin_va_list __gnuc_va_list;
# 37 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__fpos_t.h" 1 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__mbstate_t.h" 1 3 4
# 13 "/usr/include/x86_64-linux-gnu/bits/types/__mbstate_t.h" 3 4
typedef struct
{
int __count;
union
{
unsigned int __wch;
char __wchb[4];
} __value;
} __mbstate_t;
# 6 "/usr/include/x86_64-linux-gnu/bits/types/__fpos_t.h" 2 3 4
typedef struct _G_fpos_t
{
__off_t __pos;
__mbstate_t __state;
} __fpos_t;
# 40 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__fpos64_t.h" 1 3 4
# 10 "/usr/include/x86_64-linux-gnu/bits/types/__fpos64_t.h" 3 4
typedef struct _G_fpos64_t
{
__off64_t __pos;
__mbstate_t __state;
} __fpos64_t;
# 41 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/__FILE.h" 1 3 4
struct _IO_FILE;
typedef struct _IO_FILE __FILE;
# 42 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/FILE.h" 1 3 4
struct _IO_FILE;
typedef struct _IO_FILE FILE;
# 43 "/usr/include/stdio.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/types/struct_FILE.h" 1 3 4
# 35 "/usr/include/x86_64-linux-gnu/bits/types/struct_FILE.h" 3 4
struct _IO_FILE;
struct _IO_marker;
struct _IO_codecvt;
struct _IO_wide_data;
typedef void _IO_lock_t;
struct _IO_FILE
{
int _flags;
char *_IO_read_ptr;
char *_IO_read_end;
char *_IO_read_base;
char *_IO_write_base;
char *_IO_write_ptr;
char *_IO_write_end;
char *_IO_buf_base;
char *_IO_buf_end;
char *_IO_save_base;
char *_IO_backup_base;
char *_IO_save_end;
struct _IO_marker *_markers;
struct _IO_FILE *_chain;
int _fileno;
int _flags2;
__off_t _old_offset;
unsigned short _cur_column;
signed char _vtable_offset;
char _shortbuf[1];
_IO_lock_t *_lock;
__off64_t _offset;
struct _IO_codecvt *_codecvt;
struct _IO_wide_data *_wide_data;
struct _IO_FILE *_freeres_list;
void *_freeres_buf;
size_t __pad5;
int _mode;
char _unused2[15 * sizeof (int) - 4 * sizeof (void *) - sizeof (size_t)];
};
# 44 "/usr/include/stdio.h" 2 3 4
# 52 "/usr/include/stdio.h" 3 4
typedef __gnuc_va_list va_list;
# 84 "/usr/include/stdio.h" 3 4
typedef __fpos_t fpos_t;
# 133 "/usr/include/stdio.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/stdio_lim.h" 1 3 4
# 134 "/usr/include/stdio.h" 2 3 4
extern FILE *stdin;
extern FILE *stdout;
extern FILE *stderr;
extern int remove (const char *__filename) __attribute__ ((__nothrow__ , __leaf__));
extern int rename (const char *__old, const char *__new) __attribute__ ((__nothrow__ , __leaf__));
extern int renameat (int __oldfd, const char *__old, int __newfd,
const char *__new) __attribute__ ((__nothrow__ , __leaf__));
# 173 "/usr/include/stdio.h" 3 4
extern FILE *tmpfile (void) ;
# 187 "/usr/include/stdio.h" 3 4
extern char *tmpnam (char *__s) __attribute__ ((__nothrow__ , __leaf__)) ;
extern char *tmpnam_r (char *__s) __attribute__ ((__nothrow__ , __leaf__)) ;
# 204 "/usr/include/stdio.h" 3 4
extern char *tempnam (const char *__dir, const char *__pfx)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__malloc__)) ;
extern int fclose (FILE *__stream);
extern int fflush (FILE *__stream);
# 227 "/usr/include/stdio.h" 3 4
extern int fflush_unlocked (FILE *__stream);
# 246 "/usr/include/stdio.h" 3 4
extern FILE *fopen (const char *__restrict __filename,
const char *__restrict __modes) ;
extern FILE *freopen (const char *__restrict __filename,
const char *__restrict __modes,
FILE *__restrict __stream) ;
# 279 "/usr/include/stdio.h" 3 4
extern FILE *fdopen (int __fd, const char *__modes) __attribute__ ((__nothrow__ , __leaf__)) ;
# 292 "/usr/include/stdio.h" 3 4
extern FILE *fmemopen (void *__s, size_t __len, const char *__modes)
__attribute__ ((__nothrow__ , __leaf__)) ;
extern FILE *open_memstream (char **__bufloc, size_t *__sizeloc) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void setbuf (FILE *__restrict __stream, char *__restrict __buf) __attribute__ ((__nothrow__ , __leaf__));
extern int setvbuf (FILE *__restrict __stream, char *__restrict __buf,
int __modes, size_t __n) __attribute__ ((__nothrow__ , __leaf__));
extern void setbuffer (FILE *__restrict __stream, char *__restrict __buf,
size_t __size) __attribute__ ((__nothrow__ , __leaf__));
extern void setlinebuf (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int fprintf (FILE *__restrict __stream,
const char *__restrict __format, ...);
extern int printf (const char *__restrict __format, ...);
extern int sprintf (char *__restrict __s,
const char *__restrict __format, ...) __attribute__ ((__nothrow__));
extern int vfprintf (FILE *__restrict __s, const char *__restrict __format,
__gnuc_va_list __arg);
extern int vprintf (const char *__restrict __format, __gnuc_va_list __arg);
extern int vsprintf (char *__restrict __s, const char *__restrict __format,
__gnuc_va_list __arg) __attribute__ ((__nothrow__));
extern int snprintf (char *__restrict __s, size_t __maxlen,
const char *__restrict __format, ...)
__attribute__ ((__nothrow__)) __attribute__ ((__format__ (__printf__, 3, 4)));
extern int vsnprintf (char *__restrict __s, size_t __maxlen,
const char *__restrict __format, __gnuc_va_list __arg)
__attribute__ ((__nothrow__)) __attribute__ ((__format__ (__printf__, 3, 0)));
# 379 "/usr/include/stdio.h" 3 4
extern int vdprintf (int __fd, const char *__restrict __fmt,
__gnuc_va_list __arg)
__attribute__ ((__format__ (__printf__, 2, 0)));
extern int dprintf (int __fd, const char *__restrict __fmt, ...)
__attribute__ ((__format__ (__printf__, 2, 3)));
extern int fscanf (FILE *__restrict __stream,
const char *__restrict __format, ...) ;
extern int scanf (const char *__restrict __format, ...) ;
extern int sscanf (const char *__restrict __s,
const char *__restrict __format, ...) __attribute__ ((__nothrow__ , __leaf__));
extern int fscanf (FILE *__restrict __stream, const char *__restrict __format, ...) __asm__ ("" "__isoc99_fscanf")
;
extern int scanf (const char *__restrict __format, ...) __asm__ ("" "__isoc99_scanf")
;
extern int sscanf (const char *__restrict __s, const char *__restrict __format, ...) __asm__ ("" "__isoc99_sscanf") __attribute__ ((__nothrow__ , __leaf__))
;
# 432 "/usr/include/stdio.h" 3 4
extern int vfscanf (FILE *__restrict __s, const char *__restrict __format,
__gnuc_va_list __arg)
__attribute__ ((__format__ (__scanf__, 2, 0))) ;
extern int vscanf (const char *__restrict __format, __gnuc_va_list __arg)
__attribute__ ((__format__ (__scanf__, 1, 0))) ;
extern int vsscanf (const char *__restrict __s,
const char *__restrict __format, __gnuc_va_list __arg)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__format__ (__scanf__, 2, 0)));
extern int vfscanf (FILE *__restrict __s, const char *__restrict __format, __gnuc_va_list __arg) __asm__ ("" "__isoc99_vfscanf")
__attribute__ ((__format__ (__scanf__, 2, 0))) ;
extern int vscanf (const char *__restrict __format, __gnuc_va_list __arg) __asm__ ("" "__isoc99_vscanf")
__attribute__ ((__format__ (__scanf__, 1, 0))) ;
extern int vsscanf (const char *__restrict __s, const char *__restrict __format, __gnuc_va_list __arg) __asm__ ("" "__isoc99_vsscanf") __attribute__ ((__nothrow__ , __leaf__))
__attribute__ ((__format__ (__scanf__, 2, 0)));
# 485 "/usr/include/stdio.h" 3 4
extern int fgetc (FILE *__stream);
extern int getc (FILE *__stream);
extern int getchar (void);
extern int getc_unlocked (FILE *__stream);
extern int getchar_unlocked (void);
# 510 "/usr/include/stdio.h" 3 4
extern int fgetc_unlocked (FILE *__stream);
# 521 "/usr/include/stdio.h" 3 4
extern int fputc (int __c, FILE *__stream);
extern int putc (int __c, FILE *__stream);
extern int putchar (int __c);
# 537 "/usr/include/stdio.h" 3 4
extern int fputc_unlocked (int __c, FILE *__stream);
extern int putc_unlocked (int __c, FILE *__stream);
extern int putchar_unlocked (int __c);
extern int getw (FILE *__stream);
extern int putw (int __w, FILE *__stream);
extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream)
;
# 603 "/usr/include/stdio.h" 3 4
extern __ssize_t __getdelim (char **__restrict __lineptr,
size_t *__restrict __n, int __delimiter,
FILE *__restrict __stream) ;
extern __ssize_t getdelim (char **__restrict __lineptr,
size_t *__restrict __n, int __delimiter,
FILE *__restrict __stream) ;
extern __ssize_t getline (char **__restrict __lineptr,
size_t *__restrict __n,
FILE *__restrict __stream) ;
extern int fputs (const char *__restrict __s, FILE *__restrict __stream);
extern int puts (const char *__s);
extern int ungetc (int __c, FILE *__stream);
extern size_t fread (void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __stream) ;
extern size_t fwrite (const void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __s);
# 673 "/usr/include/stdio.h" 3 4
extern size_t fread_unlocked (void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __stream) ;
extern size_t fwrite_unlocked (const void *__restrict __ptr, size_t __size,
size_t __n, FILE *__restrict __stream);
extern int fseek (FILE *__stream, long int __off, int __whence);
extern long int ftell (FILE *__stream) ;
extern void rewind (FILE *__stream);
# 707 "/usr/include/stdio.h" 3 4
extern int fseeko (FILE *__stream, __off_t __off, int __whence);
extern __off_t ftello (FILE *__stream) ;
# 731 "/usr/include/stdio.h" 3 4
extern int fgetpos (FILE *__restrict __stream, fpos_t *__restrict __pos);
extern int fsetpos (FILE *__stream, const fpos_t *__pos);
# 757 "/usr/include/stdio.h" 3 4
extern void clearerr (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int feof (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern int ferror (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void clearerr_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int feof_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern int ferror_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void perror (const char *__s);
# 1 "/usr/include/x86_64-linux-gnu/bits/sys_errlist.h" 1 3 4
# 26 "/usr/include/x86_64-linux-gnu/bits/sys_errlist.h" 3 4
extern int sys_nerr;
extern const char *const sys_errlist[];
# 782 "/usr/include/stdio.h" 2 3 4
extern int fileno (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern int fileno_unlocked (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
# 800 "/usr/include/stdio.h" 3 4
extern FILE *popen (const char *__command, const char *__modes) ;
extern int pclose (FILE *__stream);
extern char *ctermid (char *__s) __attribute__ ((__nothrow__ , __leaf__));
# 840 "/usr/include/stdio.h" 3 4
extern void flockfile (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
extern int ftrylockfile (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__)) ;
extern void funlockfile (FILE *__stream) __attribute__ ((__nothrow__ , __leaf__));
# 858 "/usr/include/stdio.h" 3 4
extern int __uflow (FILE *);
extern int __overflow (FILE *, int);
# 873 "/usr/include/stdio.h" 3 4
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 2
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
void __DSVERIFIER_assume(_Bool expression){
__ESBMC_assume(expression);
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
}
void __DSVERIFIER_assert(_Bool expression){
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
((void) sizeof ((
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ; else __assert_fail (
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
"expression"
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h", 36, __extension__ __PRETTY_FUNCTION__); }))
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
;
}
void __DSVERIFIER_assert_msg(_Bool expression, char * msg){
printf("%s", msg);
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
((void) sizeof ((
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
expression
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
) ; else __assert_fail (
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
"expression"
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h", 41, __extension__ __PRETTY_FUNCTION__); }))
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/compatibility.h"
;
}
# 22 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h" 1
# 27 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
# 1 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdint.h" 1 3 4
# 9 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdint.h" 3 4
# 1 "/usr/include/stdint.h" 1 3 4
# 26 "/usr/include/stdint.h" 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/libc-header-start.h" 1 3 4
# 27 "/usr/include/stdint.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wchar.h" 1 3 4
# 29 "/usr/include/stdint.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/wordsize.h" 1 3 4
# 30 "/usr/include/stdint.h" 2 3 4
# 1 "/usr/include/x86_64-linux-gnu/bits/stdint-uintn.h" 1 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/stdint-uintn.h" 3 4
# 24 "/usr/include/x86_64-linux-gnu/bits/stdint-uintn.h" 3 4
typedef __uint8_t uint8_t;
typedef __uint16_t uint16_t;
typedef __uint32_t uint32_t;
typedef __uint64_t uint64_t;
# 38 "/usr/include/stdint.h" 2 3 4
typedef __int_least8_t int_least8_t;
typedef __int_least16_t int_least16_t;
typedef __int_least32_t int_least32_t;
typedef __int_least64_t int_least64_t;
typedef __uint_least8_t uint_least8_t;
typedef __uint_least16_t uint_least16_t;
typedef __uint_least32_t uint_least32_t;
typedef __uint_least64_t uint_least64_t;
typedef signed char int_fast8_t;
typedef long int int_fast16_t;
typedef long int int_fast32_t;
typedef long int int_fast64_t;
# 71 "/usr/include/stdint.h" 3 4
typedef unsigned char uint_fast8_t;
typedef unsigned long int uint_fast16_t;
typedef unsigned long int uint_fast32_t;
typedef unsigned long int uint_fast64_t;
# 87 "/usr/include/stdint.h" 3 4
typedef long int intptr_t;
typedef unsigned long int uintptr_t;
# 101 "/usr/include/stdint.h" 3 4
typedef __intmax_t intmax_t;
typedef __uintmax_t uintmax_t;
# 10 "/usr/lib/gcc/x86_64-linux-gnu/9/include/stdint.h" 2 3 4
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h" 2
# 1 "/usr/include/inttypes.h" 1 3 4
# 34 "/usr/include/inttypes.h" 3 4
typedef int __gwchar_t;
# 266 "/usr/include/inttypes.h" 3 4
typedef struct
{
long int quot;
long int rem;
} imaxdiv_t;
# 290 "/usr/include/inttypes.h" 3 4
extern intmax_t imaxabs (intmax_t __n) __attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__));
extern imaxdiv_t imaxdiv (intmax_t __numer, intmax_t __denom)
__attribute__ ((__nothrow__ , __leaf__)) __attribute__ ((__const__));
extern intmax_t strtoimax (const char *__restrict __nptr,
char **__restrict __endptr, int __base) __attribute__ ((__nothrow__ , __leaf__));
extern uintmax_t strtoumax (const char *__restrict __nptr,
char ** __restrict __endptr, int __base) __attribute__ ((__nothrow__ , __leaf__));
extern intmax_t wcstoimax (const __gwchar_t *__restrict __nptr,
__gwchar_t **__restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__));
extern uintmax_t wcstoumax (const __gwchar_t *__restrict __nptr,
__gwchar_t ** __restrict __endptr, int __base)
__attribute__ ((__nothrow__ , __leaf__));
# 432 "/usr/include/inttypes.h" 3 4
# 29 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h" 2
# 30 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
extern implementation impl;
typedef int64_t fxp_t;
fxp_t _fxp_one;
fxp_t _fxp_half;
fxp_t _fxp_minus_one;
fxp_t _fxp_min;
fxp_t _fxp_max;
double _dbl_max;
double _dbl_min;
fxp_t _fxp_fmask;
fxp_t _fxp_imask;
static const double scale_factor[31] = { 1.0, 2.0, 4.0, 8.0, 16.0, 32.0, 64.0,
128.0, 256.0, 512.0, 1024.0, 2048.0, 4096.0, 8192.0, 16384.0, 32768.0,
65536.0, 131072.0, 262144.0, 524288.0, 1048576.0, 2097152.0, 4194304.0,
8388608.0, 16777216.0, 33554432.0, 67108864.0, 134217728.0,
268435456.0, 536870912.0, 1073741824.0 };
static const double scale_factor_inv[31] = { 1.0, 0.5, 0.25, 0.125, 0.0625,
0.03125, 0.015625, 0.0078125, 0.00390625, 0.001953125, 0.0009765625,
0.00048828125, 0.000244140625, 0.0001220703125, 0.00006103515625,
0.000030517578125, 0.000015258789063, 0.000007629394531,
0.000003814697266, 0.000001907348633, 0.000000953674316,
0.000000476837158, 0.000000238418579, 0.000000119209290,
0.000000059604645, 0.000000029802322, 0.000000014901161,
0.000000007450581, 0.000000003725290, 0.000000001862645,
0.000000000931323 };
static const float rand_uni[10000] = { -0.486240329978498f, -0.0886462298529236f, -0.140307596103306f, 0.301096597450952f, 0.0993171079928659f, 0.971751769763271f, 0.985173975730828f, 0.555993645184930f, 0.582088652691427f, -0.153377496651175f, 0.383610009058905f, -0.335724126391271f, 0.978768141636516f, -0.276250018648572f, 0.390075705739569f, -0.179022404038782f, 0.690083827115783f, -0.872530132490992f, -0.970585763293203f, -0.581476053441704f, -0.532614615674888f, -0.239699306693312f, -0.678183014035494f, 0.349502640932782f, -0.210469890686263f, 0.841262085391842f, -0.473585465151401f, 0.659383565443701f, -0.651160036945754f, -0.961043527561335f, -0.0814927639199137f, 0.621303110569702f, -0.784529166943541f, 0.0238464770757800f, 0.392694728594110f, 0.776848735202001f, 0.0870059709310509f, 0.880563655271790f, 0.883457036977564f, -0.249235082877382f, -0.691040749216870f, 0.578731120064320f, -0.973932858000832f, -0.117699105431720f, -0.723831748151088f, -0.483149657477524f, -0.821277691383664f, -0.459725618100875f, 0.148175952221864f, 0.444306875534854f, -0.325610376336498f, 0.544142311404910f, -0.165319440455435f, 0.136706800705517f, 0.543312481350682f, 0.467210959764607f, -0.349266618228534f, -0.660110730565862f, 0.910332331495431f, 0.961049802789367f, -0.786168905164629f, 0.305648402726554f, 0.510815258508885f, 0.0950733260984060f, 0.173750645487898f, 0.144488668408672f, 0.0190031984466126f, -0.299194577636724f, 0.302411647442273f, -0.730462524226212f, 0.688646006554796f, 0.134948379722118f, 0.533716723458894f, -0.00226300779660438f, -0.561340777806718f, 0.450396313744017f, -0.569445876566955f, 0.954155246557698f, -0.255403882430676f, -0.759820984120828f, -0.855279790307514f, -0.147352581758156f, -0.302269055643746f, -0.642038024364086f, -0.367405981107491f, 0.491844011712164f, -0.542191710121194f, -0.938294043323732f, 0.683979894338020f, 0.294728290855287f, 0.00662691839443919f, -0.931040350582855f, 0.152356209974418f, 0.678620860551457f, -0.534989269238408f, 0.932096367913226f, -0.0361062818028513f, -0.847189697149530f, -0.975903030160255f, 0.623293205784014f, -0.661289688031659f, 0.724486055119603f, 0.307504095172835f, 0.00739266163731767f, -0.393681596442097f, 0.0313739422974388f, 0.0768157689673350f, -0.652063346886817f, 0.864188030044388f, -0.588932092781034f, 0.496015896758580f, -0.872858269231211f, 0.978780599551039f, -0.504887732991147f, -0.462378791937628f, 0.0141726829338038f, 0.769610007653591f, 0.945233033188923f, -0.782235375325016f, -0.832206533738799f, 0.745634368088673f, -0.696969510157151f, -0.0674631869948374f, -0.123186450806584f, -0.359158959141949f, -0.393882649464391f, 0.441371446689899f, -0.829394270569736f, -0.301502651277431f, -0.996215501187289f, 0.934634037393066f, -0.282431114746289f, -0.927550795619590f, -0.437037530043415f, -0.360426812995980f, 0.949549724575862f, 0.502784616197919f, 0.800771681422909f, -0.511398929004089f, 0.309288504642554f, -0.207261227890933f, 0.930587995125773f, -0.777029876696670f, -0.489329175755640f, -0.134595132329858f, 0.285771358983518f, 0.182331373854387f, -0.544110494560697f, 0.278439882883985f, -0.556325158102182f, 0.579043806545889f, 0.134648133801916f, 0.602850725479294f, -0.151663563868883f, 0.180694361855878f, -0.651591295315595f, 0.281129147768056f, -0.580047306475484f, 0.687883075491433f, 0.279398670804288f, -0.853428128249503f, -0.532609367372680f, -0.821156786377917f, -0.181273229058573f, -0.983898569846882f, -0.0964374318311501f, 0.880923372124250f, 0.102643371392389f, 0.893615387135596f, -0.259276649383649f, 0.699287743639363f, 0.402940604635828f, -0.110721596226581f, 0.0846246472582877f, 0.820733021865405f, 0.795578903285308f, -0.495144122011537f, 0.273150029257472f, -0.268249949701437f, 0.231982193341980f, 0.694211299124074f, 0.859950868718233f, 0.959483382623794f, -0.422972626833543f, -0.109621798738360f, 0.433094703426531f, 0.694025903378851f, 0.374478987547435f, -0.293668545105608f, -0.396213864190828f, -0.0632095887099047f, -0.0285139536748673f, 0.831794132192390f, -0.548543088139238f, 0.791869201724680f, 0.325211484201845f, 0.155274810721772f, -0.112383643064821f, -0.674403070297721f, 0.642801068229810f, -0.615712048835242f, -0.322576771285566f, -0.409336818836595f, 0.548069973193770f, -0.386353709407947f, -0.0741664985357784f, 0.619639599324983f, -0.815703814931314f, 0.965550307223862f, 0.623407852683828f, -0.789634372832984f, 0.736750050047572f, -0.0269443926793700f, 0.00545706093721488f, -0.315712479832091f, -0.890110021644720f, -0.869390443173846f, -0.381538869981866f, -0.109498998005949f, 0.131433952330613f, -0.233452413139316f, 0.660289822785465f, 0.543381186340023f, -0.384712418750451f, -0.913477554164890f, 0.767102957655267f, -0.115129944521936f, -0.741161985822647f, -0.0604180020782450f, -0.819131535144059f, -0.409539679760029f, 0.574419252943637f, -0.0440704617157433f, 0.933173744590532f, 0.261360623390448f, -0.880290575543046f, 0.329806293425492f, 0.548915621667952f, 0.635187167795234f, -0.611034070318967f, 0.458196727901944f, 0.397377226781023f, 0.711941361933987f, 0.782147744383368f, -0.00300685339552631f, 0.384687233450957f, 0.810102466029521f, 0.452919847968424f, -0.183164257016897f, -0.755603185485427f, -0.604334477365858f, -0.786222413488860f, -0.434887500763099f, -0.678845635625581f, -0.381200370488331f, -0.582350534916068f, -0.0444427346996734f, 0.116237247526397f, -0.364680921206275f, -0.829395404347498f, -0.258574590032613f, -0.910082114298859f, 0.501356900925997f, 0.0295361922006900f, -0.471786618165219f, 0.536352925101547f, -0.316120662284464f, -0.168902841718737f, 0.970850119987976f, -0.813818666854395f, -0.0861183123848732f, 0.866784827877161f, 0.535966478165739f, -0.806958669103425f, -0.627307415616045f, -0.686618354673079f, 0.0239165685193152f, 0.525427699287402f, 0.834079334357391f, -0.527333932295852f, 0.130970034225907f, -0.790218350377199f, 0.399338640441987f, 0.133591886379939f, -0.181354311053254f, 0.420121912637914f, -0.625002202728601f, -0.293296669160307f, 0.0113819513424340f, -0.882382002895096f, -0.883750159690028f, 0.441583656876336f, -0.439054135454480f, 0.873049498123622f, 0.660844523562817f, 0.0104240153103699f, 0.611420248331623f, -0.235926309432748f, 0.207317724918460f, 0.884691834560657f, 0.128302402592277f, -0.283754448219060f, 0.237649901255856f, 0.610200763264703f, -0.625035441247926f, -0.964609592118695f, -0.323146562743113f, 0.961529402270719f, -0.793576233735450f, -0.843916713821003f, 0.314105102728384f, -0.204535560653294f, 0.753318789613803f, 0.160678386635821f, -0.647065919861379f, -0.202789866826280f, 0.648108234268198f, -0.261292621025902f, 0.156681828732770f, 0.405377351820066f, 0.228465381497500f, 0.972348516671163f, 0.288346037401522f, -0.0799068604307178f, 0.916939290109587f, -0.279220972402209f, -0.203447523864279f, -0.533640046855273f, 0.543561961674653f, 0.880711097286889f, -0.549683064687774f, 0.0130107219236368f, -0.554838164576024f, -0.379442406201385f, -0.00500104610043062f, 0.409530122826868f, -0.580423080726061f, 0.824555731914455f, -0.254134502966922f, 0.655609706875230f, 0.629093866184236f, -0.690033250889974f, -0.652346551677826f, 0.169820593515952f, 0.922459552232043f, 0.351812083539940f, 0.876342426613034f, -0.513486005850680f, -0.626382302780497f, -0.734690688861027f, 0.245594886018314f, -0.875740935105191f, -0.388580462918006f, 0.0127041754106421f, -0.0330962560066819f, -0.425003146474193f, 0.0281641353527495f, 0.261441358666622f, 0.949781327102773f, 0.919646340564270f, 0.504503377003781f, 0.0817071051871894f, 0.319968570729658f, 0.229065413577318f, -0.0512608414259468f, -0.0740848540944785f, -0.0974457038582892f, 0.532775710298005f, -0.492913317622840f, 0.492871078783642f, -0.289562388384881f, 0.229149968879593f, 0.697586903105899f, 0.900855243684925f, 0.969700445892771f, -0.618162745501349f, -0.533241431614228f, -0.937955908995453f, 0.886669636523452f, 0.498748076602594f, 0.974106016180519f, -0.199411214757595f, 0.725270392729083f, -0.0279932700005097f, -0.889385821767448f, -0.452211028905500f, -0.487216271217731f, -0.577105004471439f, 0.777405674160298f, 0.390121144627092f, -0.595062864225581f, -0.844712795815575f, -0.894819796738658f, 0.0556635002662202f, 0.200767245646242f, 0.481227096067452f, -0.0854169009474664f, 0.524532943920022f, -0.880292014538901f, -0.127923833629789f, -0.929275628802356f, 0.233276357260949f, -0.776272194935070f, 0.953325886548014f, -0.884399921036004f, -0.504227548828417f, -0.546526107689276f, 0.852622421886067f, 0.947722695551154f, -0.668635552599119f, 0.768739709906834f, 0.830755876586102f, -0.720579994994166f, 0.761613532216491f, 0.340510345777526f, 0.335046764810816f, 0.490102926886310f, -0.568989013749608f, -0.296018470377601f, 0.979838924243657f, 0.624231653632879f, 0.553904401851075f, -0.355359451941014f, 0.267623165480721f, 0.985914275634075f, -0.741887849211797f, 0.560479100333108f, -0.602590162007993f, -0.874870765077352f, -0.0306218773384892f, 0.963145768131215f, 0.544824028787036f, -0.133990816021791f, 0.0679964588712787f, -0.156401335214901f, -0.0802554171832672f, 0.856386218492912f, 0.143013580527942f, 0.403921859374840f, -0.179029058044097f, 0.770723540077919f, -0.183650969350452f, -0.340718434629824f, 0.217166124261387f, -0.171159949445977f, 0.127493767348173f, -0.649649349141405f, -0.0986978180993434f, 0.301786606637125f, 0.942172200207855f, 0.0323236270151113f, -0.579853744301016f, -0.964413060851558f, 0.917535782777861f, 0.442144649483292f, -0.684960854610878f, -0.418908715566712f, 0.617844265088789f, 0.897145578082386f, 0.235463167636481f, 0.0166312355859484f, 0.948331447443040f, -0.961085640409103f, -0.0386086809179784f, -0.949138997977665f, 0.738211385880427f, 0.613757309091864f, -0.606937832993426f, 0.825253298062192f, 0.932609757667859f, -0.169023247637751f, -0.411237965787391f, 0.550590803600950f, -0.0561729280137304f, -0.559663108323671f, -0.718592671237337f, 0.885889621415361f, -0.364207826334344f, -0.839614660327507f, 0.265502694339344f, 0.394329270534417f, -0.270184577808578f, -0.865353487778069f, -0.528848754655393f, -0.179961524561963f, 0.571721065613544f, -0.774363220756696f, 0.251123315200792f, -0.217722762975159f, 0.0901359910328954f, -0.329445470667965f, 0.366410356722994f, -0.777512662632715f, 0.654844363477267f, -0.882409911562713f, -0.613612530795153f, -0.926517759636550f, 0.111572665207194f, 0.0729846382226607f, 0.789912813274098,
0.784452109264882f, -0.949766989295825f, 0.318378232675431f, 0.732077593075111f, 0.786829143208386f, -0.134682559823644f, 0.733164743374965f, 0.978410877665941f, 0.992008491438409f, -0.319064303035495f, 0.958430683602029f, 0.514518212363212f, 0.101876224417090f, 0.642655735778237f, -0.170746516901312f, 0.252352078365623f, -0.761327278132210f, 0.724119717129199f, 0.889374997869224f, -0.785987369200692f, -0.594670344572584f, 0.805192297495935f, -0.990523259595814f, 0.483998949026664f, 0.747350619254878f, -0.824845161088780f, 0.543009506581798f, -0.208778528683094f, -0.314149951901368f, 0.943576771177672f, -0.102633559170861f, -0.947663019606703f, -0.557033071578968f, 0.419150797499848f, 0.251214274356296f, 0.565717763755325f, 0.126676667925064f, -0.0213369479214840f, 0.342212953426240f, -0.288015274572288f, 0.121313363277304f, 0.452832374494206f, 0.545420403121955f, -0.616024063400938f, -0.0320352392995826f, -0.400581850938279f, 0.0642433474653812f, -0.673966224453150f, 0.951962939602010f, -0.241906012952983f, 0.0322060960995099f, -0.449185553826233f, -0.709575766146540f, 0.0283340814242898f, 0.234237103593580f, -0.285526615094797f, -0.793192668153991f, -0.437130485497140f, -0.956132143306919f, 0.601158367473616f, 0.238689691528783f, 0.173709925321432f, 0.437983847738997f, 0.397380645202102f, 0.432093344086237f, -0.0338869881121104f, -0.966303269542493f, 0.875351570183604f, -0.0584554089652962f, 0.294207497692552f, 0.200323088145182f, 0.826642387259759f, 0.284806025494260f, -0.00660991970522007f, 0.682493772727303f, -0.151980775670668f, 0.0470705546940635f, -0.236378427235531f, -0.844780853112247f, 0.134166207564174f, -0.586842667384924f, 0.0711866699414370f, 0.311698821368897f, -0.361229767252053f, 0.750924311039976f, 0.0764323989785694f, 0.898463708247144f, 0.398232179543916f, -0.515644913011399f, -0.189067061520362f, -0.567430593060929f, -0.641924269747436f, -0.0960378699625619f, -0.792054031692334f, 0.803891878854351f, -0.233518627249889f, -0.892523453249154f, 0.707550017996875f, -0.782288435525895f, -0.156166443894764f, -0.543737876329167f, 0.565637809380957f, -0.757689989749326f, -0.612543942167974f, -0.766327195073259f, 0.587626843767440f, -0.280769385897397f, -0.457487372245825f, 0.0862799426622438f, -0.616867284053547f, 0.121778903484808f, -0.451988651573766f, -0.618146087265495f, -0.285868777534354f, 0.108999472244014f, -0.620755183347358f, -0.268563184810196f, -0.721678169615489f, -0.146060198874409f, -0.661506858070617f, 0.901707853998409f, 0.222488776533930f, 0.679599685031679f, 0.974760448601209f, 0.535485953830496f, -0.562345697123585f, 0.369219363331071f, -0.0282801684694869f, -0.0734880727832297f, 0.733216287314358f, -0.514352095765627f, -0.850813063545195f, 0.642458447327163f, 0.118661521915783f, -0.907015526838341f, 0.789277766886329f, -0.719864125961721f, 0.274329068829509f, 0.830124687647056f, 0.719352367261587f, -0.821767317737384f, -0.840153496829227f, 0.650796781936517f, 0.381065387870166f, 0.341870564586224f, -0.00174423702285131f, -0.216348832349188f, 0.678010477635713f, -0.748695103596683f, -0.819659325555269f, 0.620922373008647f, 0.471659250504894f, 0.417848292160984f, -0.990577315445198f, -0.509842007818877f, 0.705761459091187f, 0.723072116074702f, -0.606476484252158f, -0.871593699865195f, -0.662059658667501f, -0.207267692377271f, -0.274706370444270f, 0.317047325063391f, 0.329780707114887f, -0.966325651181920f, -0.666131009799803f, 0.118609206658210f, 0.232960448350140f, -0.139134616436389f, -0.936412642687343f, -0.554985387484625f, -0.609914445911143f, -0.371023087262482f, -0.461044793696911f, 0.0277553171809701f, -0.241589304772568f, -0.990769995548029f, 0.114245771600061f, -0.924483328431436f, 0.237901450206836f, -0.615461633242452f, 0.201497106528945f, -0.599898812620374f, 0.982389910778332f, 0.125701388874024f, -0.892749115498369f, 0.513592673006880f, 0.229316745749793f, 0.422997355912517f, 0.150920221978738f, 0.447743452078441f, 0.366767059168664f, -0.605741985891581f, 0.274905013892524f, -0.861378867171578f, -0.731508622159258f, 0.171187057183023f, 0.250833501952177f, -0.609814068526718f, -0.639397597618127f, -0.712497631420166f, -0.539831932321101f, -0.962361328901384f, 0.799060001548069f, 0.618582550608426f, -0.603865594092701f, -0.750840334759883f, -0.432368099184739f, -0.581021252111797f, 0.134711953024238f, 0.331863889421602f, -0.172907726656169f, -0.435358718118896f, -0.689326993725649f, 0.415840315809038f, -0.333576262820904f, 0.279343777676723f, -0.0393098862927832f, 0.00852090010085194f, -0.853705195692250f, 0.526006696633762f, -0.478653377052437f, -0.584840261391485f, 0.679261003071696f, 0.0367484618219474f, -0.616340335633997f, -0.912843423145420f, -0.221248732289686f, -0.477921890680232f, -0.127369625511666f, 0.865190146410824f, 0.817916456258544f, 0.445973590438029f, -0.621435280140991f, -0.584264056171687f, 0.718712277931876f, -0.337835985469843f, 0.00569064504159345f, -0.546546294846311f, 0.101653624648361f, -0.795498735829364f, -0.249043531299132f, -0.112839395737321f, -0.350305425122331f, -0.910866368205041f, 0.345503177966105f, -0.549306515692918f, 0.711774722622726f, 0.283368922297518f, 0.0401988801224620f, 0.269228967910704f, 0.408165826013612f, -0.306571373865680f, 0.937429053394878f, 0.992154362395068f, 0.679431847774404f, 0.660561953302554f, 0.903254489326130f, -0.939312119455540f, -0.211194531611303f, 0.401554296146757f, -0.0373187111351370f, -0.209143098987164f, -0.483955198209448f, -0.860858509666882f, 0.847006442151417f, 0.287950263267018f, 0.408253171937961f, -0.720812569529331f, 0.623305171273525f, 0.543495760078790f, -0.364025150023839f, -0.893335585394842f, -0.757545415624741f, -0.525417020183382f, -0.985814550271000f, -0.571551008375522f, 0.930716377819686f, -0.272863385293023f, 0.982334910750391f, 0.297868844366342f, 0.922428080219044f, 0.917194773824871f, 0.846964493212884f, 0.0641834146212110f, 0.279768184306094f, 0.591959126556958f, 0.355630573995206f, 0.839818707895839f, 0.219674727597944f, -0.174518904670883f, 0.708669864813752f, -0.224562931791369f, 0.677232454840133f, -0.904826802486527f, -0.627559033402838f, 0.263680517444611f, 0.121902314059156f, -0.704881790282995f, 0.242825089229032f, -0.309373554231866f, -0.479824461459095f, -0.720536286348018f, -0.460418173937526f, 0.774174710513849f, 0.452001499049874f, -0.316992092650694f, 0.153064869645527f, -0.209558599627989f, 0.685508351648252f, -0.508615450383790f, 0.598109567185095f, 0.391177475074196f, 0.964444988755186f, 0.336277292954506f, -0.0367817159101076f, -0.668752640081528f, 0.169621732437504f, -0.440925495294537f, 0.352359477392856f, 0.300517139597811f, 0.464188724292127f, 0.342732840629593f, -0.772028689116952f, 0.523987886508557f, 0.920723209445309f, 0.325634245623597f, 0.999728757965472f, -0.108202444213629f, -0.703463061246440f, -0.764321104361266f, 0.153478091277821f, 0.400776808520781f, 0.0362608595686520f, 0.602660289034871f, -0.00396673312072204f, 0.296881393918662f, 0.563978362789779f, 0.849699999703012f, 0.699481370949461f, -0.517318771826836f, 0.488696839410786f, -0.863267084031406f, 0.0353144039838211f, 0.346060763700543f, 0.964270355001567f, 0.354899825242107f, 0.806313705199543f, 0.675286452110240f, 0.0873918818789949f, -0.595319879813140f, 0.768247284622921f, 0.424433552458434f, -0.308023836359512f, 0.802163480612923f, -0.348151008192881f, -0.889061130591849f, -0.593277042719599f, -0.669426232128590f, 0.758542808803890f, 0.515943031751579f, -0.359688459650311f, 0.568175936707751f, 0.741304023515212f, 0.260283681057109f, 0.957668849401749f, -0.665096753421305f, 0.769229664798946f, -0.0871019488695104f, -0.362662093346394f, -0.411439775739547f, 0.700347493632751f, 0.593221225653487f, 0.712841887456470f, 0.413663813878195f, -0.868002281057698f, -0.704419248587642f, 0.497097875881516f, -0.00234623694758684f, 0.690202361192435f, -0.850266199595343f, 0.315244026446767f, 0.709124123964306f, 0.438047076925768f, 0.798239617424585f, 0.330853072912708f, 0.581059745965701f, 0.449755612947191f, -0.462738032798907f, 0.607731925865227f, 0.0898348455002427f, -0.762827831849901f, 0.895598896497952f, -0.752254194382105f, -0.0916186048978613f, -0.906243795607547f, 0.229263971313788f, 0.401148319671400f, -0.699999035942240f, 0.949897297168705f, 0.442965954562621f, -0.836602533575693f, 0.960460356865877f, -0.588638958628591f, -0.826876652501322f, 0.358883606332526f, 0.963216314331105f, -0.932992215875777f, -0.790078242370583f, 0.402080896170037f, -0.0768348888017805f, 0.728030138891631f, -0.259252300581205f, -0.239039520569651f, -0.0343187629251645f, -0.500656851699075f, 0.213230170834557f, -0.806162554023268f, -0.346741158269134f, 0.593197383681288f, -0.874207905790597f, 0.396896283395687f, -0.899758892162590f, 0.645625478431829f, 0.724064646901595f, 0.505831437483414f, -0.592809028527107f, 0.191058921738261f, 0.329699861086760f, 0.637747614705911f, 0.228492417185859f, 0.350565075483143f, 0.495645634191973f, 0.0378873636406241f, -0.558682871042752f, -0.0463515226573312f, -0.699882077624744f, -0.727701564368345f, -0.185876979038391f, 0.969357227041006f, -0.0396554302826258f, 0.994123321254905f, -0.103700411263859f, -0.122414150286554f, -0.952967253268750f, -0.310113557790019f, 0.389885130024049f, 0.698109781822753f, -0.566884614177461f, -0.807731715569885f, 0.295459359747620f, 0.353911434620388f, -0.0365360121873806f, -0.433710246410727f, -0.112374658849445f, -0.710362620548396f, -0.750188568899340f, -0.421921409270312f, -0.0946825033112555f, -0.207114343395422f, -0.712346704375406f, -0.762905208265238f, 0.668705185793373f, 0.874811836887758f, 0.734155331047614f, 0.0717699959166771f, -0.649642655211151f, 0.710177200600726f, -0.790892796708330f, -0.609051316139055f, 0.158155751049403f, 0.273837117392194f, 0.101461674737037f, -0.341978434311156f, 0.358741707078855f, 0.415990974906378f, 0.760270133083538f, 0.164383469371383f, 0.559847879549422f, 0.209104118141764f, -0.265721227148806f, 0.165407943936551f, 0.611035396421350f, -0.626230501208063f, -0.116714293310250f, -0.696697517286888f, 0.0545261414014888f, 0.440139257477096f, 0.202311640602444f, -0.369311356303593f, 0.901884565342531f, 0.256026357399272f, -0.673699547202088f, 0.108550667621349f, -0.961092940829968f, -0.254802826645023f, 0.553897912330318f, 0.110751075533042f, -0.587445414043347f, 0.786722059164009,
0.182042556749386f, 0.398835909383655f, 0.431324012457533f, 0.587021142157922f, -0.644072183989352f, 0.187430090296218f, 0.516741122998546f, -0.275250933267487f, -0.933673413249875f, -0.767709448823879f, 0.00345814033609182f, -0.585884382069128f, 0.463549040471035f, 0.666537178805293f, -0.393605927315148f, -0.260156573858491f, -0.298799291489529f, -0.246398415746503f, 0.970774181159203f, -0.485708631308223f, -0.456571313115555f, -0.264210030877189f, -0.442583504871362f, 0.0585567697312368f, 0.955769232723545f, 0.651822742221258f, 0.667605490119116f, -0.178564750516287f, 0.744464599638885f, -0.0962758978504710f, -0.538627454923738f, -0.844634654117462f, 0.109151162611125f, -0.862255427201396f, -0.478955305843323f, 0.645965860697344f, 0.345569271369828f, 0.930605011671297f, -0.195523686135506f, 0.927940875293964f, 0.0529927450986318f, -0.537243314646225f, 0.0815400161801159f, -0.528889663721737f, -0.0803965087898244f, 0.722188412643543f, -0.115173100460772f, 0.391581967064874f, 0.609102624309301f, -0.726409099849031f, -0.924071529212721f, -0.424370859730340f, -0.932399086010354f, -0.679903916227243f, 0.398593637781810f, -0.395942610474455f, 0.911017267923838f, 0.830660098751580f, 0.485689056693942f, -0.634874052918746f, 0.558342102044082f, 0.153345477027740f, -0.418797532948752f, -0.962412446404476f, 0.499334884055701f, 0.772755578982235f, 0.486905718186221f, -0.680415982465391f, -0.983589696155766f, 0.0802707365440833f, -0.108186099494932f, 0.272227706025405f, 0.651170828846750f, -0.804713753056757f, 0.778076504684911f, 0.869094633196957f, -0.213764089899489f, -0.289485853647921f, -0.248376169846176f, -0.273907386272412f, -0.272735585352615f, -0.851779302143109f, 0.777935500545070f, 0.610526499062369f, -0.825926925832998f, -0.00122853287679647f, -0.250920102747366f, -0.0333860483260329f, 0.562878228390427f, 0.685359102189134f, 0.909722844787783f, -0.686791591637469f, 0.700018932525581f, -0.975597558640926f, 0.111273045778084f, 0.0313167229308478f, -0.185767397251192f, -0.587922465203314f, -0.569364866257444f, -0.433710470415537f, 0.744709870476354f, 0.812284989338678f, -0.835936210940005f, 0.409175739115410f, 0.364745324015946f, -0.526496413512530f, -0.0949041293633228f, -0.710914623019602f, -0.199035360261516f, 0.249903358254580f, 0.799197892184193f, -0.974131439735146f, -0.962913228246770f, -0.0584067290846062f, 0.0678080882131218f, 0.619989552612058f, 0.600692636138022f, -0.325324145536173f, 0.00758797937831957f, -0.133193608214778f, -0.312408219890363f, -0.0752971209304969f, 0.764751638735404f, 0.207290375565515f, -0.965680055629168f, 0.526346325957267f, 0.365879948128040f, -0.899713698342006f, 0.300806506284083f, 0.282047017067903f, -0.464418831301796f, -0.793644005532544f, -0.338781149582286f, 0.627059412508279f, -0.624056896643864f, -0.503708045945915f, 0.339203903916317f, -0.920899287490514f, -0.753331218450680f, -0.561190137775443f, 0.216431106588929f, -0.191601189620092f, 0.613179188721972f, 0.121381145781083f, -0.477139741951367f, 0.606347924649253f, 0.972409497819530f, 0.00419185232258634f, 0.786976564006247f, 0.716984027373809f, -0.577296880358192f, 0.336508364109364f, -0.837637061538727f, -0.706860533591818f, 0.655351330285695f, -0.799458036429467f, 0.804951754011505f, 0.405471126911303f, 0.485125485165526f, 0.0354103156047567f, 0.774748847269929f, 0.396581375869036f, 0.420464745452802f, -0.544531741676535f, -0.779088258182329f, -0.129534599431145f, 0.228882319223921f, 0.669504936432777f, -0.158954596495398f, -0.171927546721685f, 0.675107968066445f, -0.201470217862098f, -0.185894687796509f, 0.244174688826684f, 0.310288210346694f, -0.0674603586289346f, 0.138103839181198f, 0.269292861340219f, 0.121469813317732f, 0.168629748875041f, 0.581112629873687f, 0.499508530746584f, -0.741772433024897f, -0.311060071316150f, -0.263697352439521f, 0.180487383518774f, -0.800786488742242f, -0.949903966987338f, 0.134975524166410f, 0.213364683193138f, -0.684441197699222f, -0.254697287796379f, -0.260521050814253f, -0.757605554637199f, -0.134324873215927f, -0.699675596579060f, 0.136000646890289f, 0.355272520354523f, -0.712620797948690f, -0.729995036352282f, 0.323100037780915f, -0.718364487938777f, 0.807709622188084f, 0.289336059472722f, -0.558738026311145f, -0.591811756545896f, -0.894952978489225f, -0.354996929975694f, -0.142213103464027f, -0.651950180085633f, 0.182694586161578f, -0.193492058009904f, -0.540079537334588f, -0.300927433533712f, 0.119585035086049f, 0.895807833710939f, -0.413843745301811f, -0.209041322713332f, 0.808094803654324f, 0.0792829008489782f, 0.314806980452270f, 0.502591873175427f, -0.0474189387090473f, -0.407131047818007f, 0.797117088440354f, 0.902395237588928f, -0.783327055804990f, -0.591709085168646f, 0.628191184754911f, -0.454649879692076f, -0.588819444306752f, 0.250889716959370f, -0.582306627010669f, -0.145495766591841f, -0.634137346823528f, 0.667934845545285f, 0.873756470938530f, 0.425969845715827f, -0.779543910541245f, -0.265210219994391f, 0.781530681845886f, 0.304461599274577f, 0.211087853085430f, 0.281022407596766f, 0.0701313665097776f, 0.342337400087349f, -0.0618264046031387f, 0.177147380816613f, 0.751693209867024f, -0.279073264607508f, 0.740459307255654f, -0.352163564204507f, -0.726238685136937f, -0.565819729501492f, -0.779416133306559f, -0.783925450697670f, 0.542612245021260f, -0.810510148278478f, -0.693707081804938f, 0.918862988543900f, -0.368717045271828f, 0.0654919784331340f, -0.438514219239944f, -0.923935138084824f, 0.913316783811291f, -0.961646539574340f, 0.734888382653474f, -0.464102713631586f, -0.896154678819649f, 0.349856565392685f, 0.646610836502422f, -0.104378701809970f, 0.347319102015858f, -0.263947819351090f, 0.343722186197186f, 0.825747554146473f, 0.0661865525544676f, 0.918864908112419f, -0.999160312662909f, -0.904953244747070f, 0.246613032125664f, 0.123426960800262f, -0.294364203503845f, -0.150056966431615f, 0.904179479721301f, 0.517721252782648f, 0.661473373608678f, -0.784276966825964f, -0.984631287069650f, 0.239695484607744f, -0.499150590123099f, 0.00153518224500027f, -0.817955534401114f, 0.221240310713583f, 0.114442325207070f, -0.717650856748245f, -0.722902799253535f, -0.962998380704103f, 0.214092155997873f, -0.226370691123970f, 0.536806140446569f, 0.111745807092858f, 0.657580594136395f, -0.239950592200226f, 0.0981270621736083f, -0.173398466414235f, 0.414811672195735f, 0.147604904291238f, -0.649219724907210f, 0.907797399703411f, -0.496097071857490f, -0.0958082520749422f, -0.700618145301611f, 0.238049932994406f, 0.946616020659334f, 0.143538494511824f, 0.0641076718667677f, 0.377873848622552f, -0.413854028741624f, -0.838831021130186f, 0.0208044297354626f, 0.476712667979210f, 0.850908020233298f, 0.0692454021020814f, 0.841788714865238f, -0.251777041865926f, 0.512215668857165f, 0.827988589806208f, -0.399200428030715f, 0.999219950547600f, -0.00465542086542259f, 0.279790771964531f, -0.683125623289052f, 0.988128867315143f, 0.00697090775456410f, -0.409501680375786f, -0.190812202162744f, -0.154565639467601f, 0.305734586628079f, -0.922825484202279f, -0.0622811516391562f, -0.502492855870975f, 0.358550513844403f, 0.678271216185703f, -0.940222215291861f, 0.568581934651071f, 0.953835466578938f, -0.476569789986603f, 0.0141049472573418f, 0.722262461730185f, -0.128913572076972f, -0.583948340870808f, -0.254358587904773f, -0.390569309413304f, -0.0495119137883056f, -0.486356443935695f, -0.112768011009410f, -0.608763417511343f, -0.145843822867367f, 0.767829603838659f, 0.791239479733126f, 0.0208376062066382f, -0.524291005204912f, -0.200159553848628f, -0.835647719235620f, -0.222774380961612f, 0.0617292533934060f, 0.233433696650208f, -0.543969878951657f, -0.628168009147650f, -0.725602523060817f, -0.273904472034828f, 0.320527317085229f, -0.556961185821848f, 0.261533413201255f, 0.696617398495973f, 0.200506775746016f, -0.395581923906907f, 0.0196423782530712f, -0.0552577396777472f, -0.594078139517501f, -0.816132673139052f, -0.898431571909616f, 0.879105843430143f, 0.949666380003024f, -0.245578843355682f, 0.528960018663897f, 0.201586039072583f, -0.651684706542954f, 0.596063456431086f, -0.659712784781056f, -0.213702651629353f, -0.629790163054887f, -0.0572029778771013f, 0.645291034768991f, -0.453266855343461f, -0.581253959024410f, 0.632682730071992f, 0.991406037765467f, 0.701390336150136f, -0.879037255220971f, -0.304180069776406f, 0.0969095808767941f, -0.465682778651712f, 0.815108046274786f, -0.532850846043973f, 0.950550134670033f, 0.296008118726089f, -0.198390447541329f, 0.159049143352201f, 0.105169964332594f, -0.482506131358523f, 0.493753482281684f, 0.292058685647414f, 0.283730532860951f, 0.00323819209092657f, 0.765838273699203f, -0.0753176377562099f, -0.679824808630431f, 0.548180003463159f, -0.996048798712591f, 0.782768288046545f, 0.396509190560532f, 0.848686742379558f, 0.750049741585178f, 0.730186188655936f, -0.0220701180542726f, -0.487618042364281f, -0.403562199756249f, -0.0693129490117646f, 0.947019452953246f, -0.731947366410442f, 0.198175872470120f, -0.329413252854837f, -0.641319161749268f, 0.186271826190842f, -0.0739989831663739f, -0.334046268448298f, -0.191676071751509f, -0.632573515889708f, -0.999115061914042f, -0.677989795015932f, 0.289828136337821f, 0.696081747094487f, 0.965765319961706f, -0.203649463803737f, -0.195384468978610f, 0.746979659338745f, 0.701651229142588f, -0.498361303522421f, 0.289120104962302f, 0.270493509228559f, -0.132329670835432f, 0.385545665843914f, -0.265371843427444f, 0.306155119003788f, -0.859790373316264f, -0.0198057838521546f, 0.233572324299025f, 0.426354273793125f, -0.510901479579029f, -0.600001464460011f, -0.972316846268671f, 0.531678082677910f, -0.0543913028234813f, -0.860333915321655f, 0.0717414549918496f, -0.992726205437930f, 0.587189647572868f, -0.710120198811545f, -0.712433353767817f, 0.000905613890617163f, 0.323638959833707f, -0.148002344942812f, 0.422217478090035f, -0.512122539396176f, -0.652032513920892f, -0.0749826795945674f, 0.689725543651565f, 0.00708142459169103f, 0.612282380092436f, -0.182868915402510f, -0.478704046524703f, 0.630078231167476f, -0.201694106935605f, 0.471080354222778f, 0.705764111397718f, 0.504296612895499f, -0.245442802115836f, -0.0255433216413170f, 0.244606720514349f, -0.620852691611321f, 0.130333792055452f, -0.0404066268217753f, 0.533698497858480f, 0.569324696850915f, -0.0208385747745345f, -0.344454279574176f, 0.697793551353488f, 0.223740789443046,
0.0819835387259940f, -0.378565059057637f, 0.265230570199009f, -0.654654047270763f, -0.959845479426107f, -0.524706200047066f, -0.320773238900823f, 0.133125806793072f, 0.204919719422386f, 0.781296208272529f, 0.357447172843949f, -0.295741363322007f, -0.531151992759176f, -0.928760461863525f, -0.492737999698919f, 0.185299312597934f, 0.0308933157463984f, 0.0940868629278078f, -0.223134180713975f, -0.728994909644464f, 0.748645378716214f, 0.602424843862873f, 0.939628558971957f, -0.601577015562304f, -0.178714119359324f, 0.812720866753088f, -0.864296642561293f, 0.448439532249340f, 0.423570043689909f, 0.883922405988390f, -0.121889129001415f, -0.0435604321758833f, -0.823641147317994f, -0.775345608718704f, -0.621149628042832f, 0.532395431283659f, -0.803045105215129f, 0.897460124955135f, 0.432615281777583f, -0.0245386640589920f, -0.822321626075771f, -0.992080038736755f, -0.829220327319793f, 0.125841786813822f, 0.277412627470833f, 0.623989234604340f, -0.207977347981346f, -0.666564975567417f, 0.419758053880881f, -0.146809205344117f, 0.702495819380827f, 0.802212477505035f, 0.161529115911938f, 0.987832568197053f, -0.885776673164970f, -0.608518024629661f, -0.126430573784758f, 0.168260422890915f, -0.517060428948049f, -0.766296586196077f, -0.827624510690858f, -0.149091785188351f, -0.643782325842734f, 0.768634567718711f, 0.815278279059715f, -0.648037361329720f, -0.480742843535214f, 0.983809287193308f, -0.701958358623791f, 0.0797427982273327f, 0.903943825454071f, 0.980486658260621f, 0.207436790541324f, -0.536781321571165f, -0.885473392956838f, -0.626744905152131f, 0.279917970592554f, -0.489532633799085f, 0.402084958261836f, -0.566738134593205f, -0.0990017532286025f, 0.458891753618823f, 0.893734110503312f, 0.541822126435773f, -0.856210577956263f, -0.0354679151809227f, -0.868531503535520f, 0.150589222911699f, 0.611651396802303f, 0.524911319413221f, 0.555472734209632f, -0.723626819813614f, -0.162106613127807f, 0.602405197560299f, 0.903198408993777f, 0.329150411562290f, -0.806468536757339f, -0.671787125844359f, -0.707262852044556f, 0.474934689940169f, -0.379636706541612f, 0.404933387269815f, 0.332303761521238f, 0.394233678536033f, -0.0366067593524413f, 0.904405677123363f, -0.356597686978725f, -0.623034135107067f, 0.572040316921149f, 0.799160684670195f, -0.507817199545094f, -0.533380730448667f, -0.884507921224020f, -0.00424735629746076f, 0.647537115339283f, 0.456309536956504f, -0.766102127867730f, -0.625121831714406f, 0.341487890703535f, -0.360549668352997f, -0.229900108098778f, -0.666760418812903f, 0.813282715359911f, 0.115522674116703f, -0.221360306077384f, 0.0297293679340875f, 0.00682810040637105f, 0.0115235719886584f, 0.887989949086462f, 0.792212187398941f, 0.415172771519484f, -0.600202208047434f, 0.949356119962045f, -0.526700730890731f, 0.946712583567682f, -0.392771116330410f, 0.0144823046999243f, -0.649518061223406f, 0.724776068810104f, 0.00920735790862981f, -0.461670796134611f, 0.217703889787716f, 0.846151165623083f, -0.202702970245097f, 0.314177560430781f, -0.761102867343919f, 0.0528399640076420f, -0.986438508940994f, -0.595548022863232f, -0.430067198426456f, 0.150038004203120f, 0.738795383589380f, -0.605707072657181f, -0.597976219376529f, 0.375792542283657f, -0.321042914446039f, 0.902243988712398f, 0.463286578609220f, -0.739643422607773f, 0.210980536147575f, -0.539210294582617f, 0.405318056313257f, -0.876865698043818f, -0.0883135270940518f, 0.0300580586347285f, -0.657955040210154f, 0.159261648552234f, 0.288659459148804f, 0.274488527537659f, 0.646615145281349f, 0.431532024055095f, -0.982045186676854f, -0.777285361097106f, -0.124875006659614f, 0.503004910525253f, 0.824987340852061f, -0.859357943951028f, -0.894837450578304f, 0.744772864540654f, 0.415263521487854f, 0.337833126081168f, -0.612498979721313f, 0.391475686177086f, 0.573982630935632f, -0.391044576636065f, 0.669493459114130f, -0.763807443372196f, -0.898924075896803f, -0.969897663976237f, -0.266947396046322f, 0.198506503481333f, -0.355803387868922f, 0.787375525807664f, 0.655019979695179f, -0.266247398074148f, -0.665577607941915f, 0.0617617780742654f, -0.303207459096743f, 0.807119242186051f, -0.864431193732911f, 0.711808914065391f, 0.267969697417500f, -0.643939259651104f, -0.723685356192067f, 0.887757759160107f, -0.318420101532538f, -0.984559057628900f, -0.123118506428834f, 0.264872379685241f, 0.258477870902406f, -0.727462993670953f, -0.223845786938221f, 0.683462211502638f, -0.989811504909606f, 0.292644294487220f, -0.926087081411227f, -0.801377664261936f, -0.337757621052903f, 0.356167431525877f, 0.974619379699180f, 0.456124311183874f, 0.664192098344107f, -0.910993234571633f, -0.484097468631090f, -0.128534589958108f, -0.770879324529314f, 0.320053414246682f, 0.249818479771296f, 0.0153345543766990f, 0.696352481669035f, -0.397719804512483f, 0.670333638147646f, -0.678192291329959f, 0.190143924397131f, 0.342035884244954f, -0.350791038317704f, 0.0218450632953668f, 0.437133719806156f, 0.659960895652910f, 0.903378806323159f, 0.855089775229062f, 0.946706092624795f, 0.335540975081955f, 0.838337968455111f, -0.102693592034237f, -0.702102376052106f, 0.409624309223486f, -0.654483499569910f, 0.886576641430416f, -0.200573725141884f, -0.461284656727627f, 0.262661770963709f, 0.867505406245483f, -0.0688648080253220f, -0.707487995489326f, -0.248871627068848f, -0.197869870234198f, -0.243745607075197f, -0.244106806741608f, 0.489848112299788f, -0.0909708869175492f, -0.377678949786167f, 0.0385783576998284f, -0.470361956031595f, 0.802403491439449f, -0.408319987166305f, 0.345170991986463f, -0.433455880962420f, 0.00950587287655291f, -0.441888155900165f, -0.817874450719479f, 0.818308133775667f, 0.931915253798354f, 0.818494801634479f, 0.787941704188320f, 0.882012210451449f, 0.0749985961399193f, 0.259772455233352f, -0.655786948552735f, 0.0824323575519799f, 0.980211564632039f, -0.798619050684746f, 0.496019643929772f, -0.727312997781404f, -0.999839600489443f, 0.625938920414345f, -0.561059012154101f, 0.215650518505246f, 0.121571798563274f, 0.161863493108371f, -0.340322748036792f, 0.521792371708641f, 0.655248389359818f, -0.180967013066484f, 0.936797969156762f, 0.523749660366580f, 0.764744126333943f, 0.384701560810431f, -0.744092118301334f, 0.719721922905938f, 0.365931545158250f, -0.720202871171563f, 0.121662048491076f, -0.355501954289222f, 0.379420491208481f, -0.593818415223405f, -0.433690576121147f, -0.766763563509045f, -0.377445104709670f, -0.955638620720410f, 0.309622585052195f, -0.613767678153186f, 0.0177719922394908f, 0.362917537485277f, -0.297613292472489f, 0.0275561832152067f, -0.962345352767599f, 0.452866577068408f, -0.307485159523065f, 0.931778412136845f, 0.639592220588070f, 0.00782144244951311f, -0.0466407334447796f, -0.134392603781566f, 0.895314655361308f, -0.537785271016286f, 0.663926391064792f, -0.886126633268266f, -0.0975129470189278f, -0.429791706025144f, -0.440337831994928f, -0.00156267573188829f, 0.933113069253665f, -0.560704402651437f, -0.201658150324907f, 0.465819560354530f, 0.0701448781871696f, 0.859597672251104f, -0.525851890358272f, -0.992674038068357f, -0.0846761339576128f, -0.401686794568758f, -0.886069686075370f, -0.480254412625133f, 0.432758053902000f, 0.168651590377605f, -0.453397134906684f, 0.340250287733381f, -0.972972507965963f, 0.0560333167197302f, -0.180812774382952f, -0.689848943619717f, -0.427945332505659f, 0.771841237806370f, 0.329334772795521f, 0.573083591606505f, 0.280711890938316f, -0.265074342340277f, -0.166538165045598f, -0.0612128221482104f, 0.458392746490372f, 0.199475931235870f, 0.681819191997175f, 0.356837960840067f, 0.756968760265553f, 0.763288512531608f, -0.890082643508294f, -0.322752448111365f, 0.799445915816577f, -0.956403501496524f, 0.723055987751969f, 0.943900989848643f, -0.217092255585658f, -0.426893469064855f, 0.834596828462842f, 0.723793256883097f, 0.781491391875921f, 0.928040296363564f, -0.468095417622644f, 0.758584798435784f, 0.589732897992602f, 0.929077658343636f, 0.829643041135239f, 0.0947252609994522f, 0.554884923338572f, -0.513740258764285f, -0.221798194292427f, 0.499855133319165f, -0.0237986912033636f, 0.559618648100625f, -0.509812142428963f, -0.444047241791607f, 0.678274420898738f, -0.983706185790147f, -0.295400077545522f, -0.688769625375228f, 0.729259863393412f, 0.889478872450658f, 0.928277502215167f, -0.429388564745762f, -0.790568684428380f, 0.930220908227667f, -0.796970618648576f, -0.980240003047008f, 0.0372716153521411f, -0.290828043433527f, -0.303854123029680f, 0.160774056645456f, -0.712081432630280f, 0.390787025293754f, 0.981202442873064f, -0.679439021090013f, 0.183053153027806f, 0.665002789261745f, -0.708708782620398f, 0.254574948166343f, 0.0575397183305137f, -0.723713533137924f, -0.732816726186887f, 0.501983534740534f, 0.879998734527489f, 0.825871571001792f, 0.920880943816000f, 0.311565022703289f, -0.788226302840017f, -0.223197800016568f, 0.850662847422425f, -0.365181128095578f, 0.958907951854379f, -0.0421327708909884f, -0.153860389403659f, -0.219620959578892f, -0.469076971423126f, -0.523348925540362f, -0.287762354299832f, -0.913332930679763f, 0.403264134926789f, 0.725849051303960f, 0.743650157693605f, -0.382580349065687f, -0.297138545454038f, -0.480092092629432f, 0.0412697614821378f, -0.396203822475830f, -0.0721078217568973f, 0.979038611510460f, -0.766187876085830f, -0.344262922592081f, 0.943351952071948f, -0.219460259008486f, 0.115393587800227f, -0.342675526066015f, 0.926460460401492f, -0.486133445041596f, 0.0722019534490863f, -0.571069005453629f, -0.0854568609959852f, 0.370182934471805f, -0.554007448618166f, 0.899885956615126f, -0.188476209845590f, -0.548132066932086f, 0.0559544259937872f, -0.161750926638529f, -0.532342080900202f, 0.585205009957713f, -0.374876171959848f, -0.169253952741901f, -0.473665572804341f, 0.942267543457416f, -0.515867520277168f, -0.706362509002908f, -0.320672724679343f, -0.398410016134417f, 0.733774712982205f, 0.449599271169282f, 0.109119420842892f, -0.285090495549516f, 0.0854116107702212f, 0.0603189331827261f, -0.943780826189008f, 0.0679186452322331f, 0.0975973769951632f, -0.870728474197789f, -0.153122881744074f, -0.519939625069588f, -0.633620207951748f, -0.767551214057718f, -0.905802311420298f, -0.841350087901049f, -0.271805404203346f, 0.282221543099561f, -0.0874121080198842f, 0.0634591013505281f, 0.318965595714934f, -0.865047622711268f, -0.401960840475322f, 0.637557181177199f, -0.664578054110050f, -0.871253510227744,
-0.893972634695541f, 0.442396058421524f, -0.427901040556135f, -0.740186385510743f, 0.788155411447006f, -0.541278113339818f, 0.509586521956676f, -0.461159620800394f, 0.664671981848839f, 0.880365181842209f, -0.0831685214800200f, 0.952827020902887f, 0.183226454466898f, -0.176729350626920f, 0.851946105206441f, -0.361976142339276f, 0.357209010683668f, 0.982462882042961f, -0.690757734204635f, 0.178681657923363f, -0.0804395784672956f, 0.971787623805611f, 0.875217157810758f, 0.160844021450331f, -0.359951755747351f, 0.0178495935461525f, 0.0203610854761294f, 0.413933338290502f, -0.676038601090005f, -0.111093077131977f, -0.381792206260952f, -0.459903351782575f, 0.308522841938619f, 0.324961267942541f, 0.365201262605939f, 0.732543185546895f, -0.559558093250200f, 0.848266528378337f, -0.185546299813159f, 0.997052205707190f, -0.932554828383249f, -0.106322273904826f, -0.0690562674587807f, 0.919489002936141f, 0.137210930163322f, -0.664517238270193f, -0.985856844408119f, -0.0719443995256963f, -0.602400574547167f, -0.398979518518077f, -0.581117055144305f, -0.0626081333075188f, -0.0372763806643306f, -0.688808592854889f, 0.703980953746103f, -0.480647539644480f, 0.615510592326288f, -0.940226159289884f, -0.953483236094818f, -0.300312284206625f, -0.819419230573751f, 0.657560634657022f, -0.0500336389233971f, 0.628589817614501f, 0.717012803783103f, -0.0315450822394920f, -0.445526173532186f, 0.521475917548504f, -0.479539088650145f, 0.695075897089419f, -0.0365115706205694f, 0.0256264409967832f, -0.0121306374106025f, -0.817618774100623f, 0.375407640753000f, 0.944299492219378f, -0.717119961760812f, -0.120740746804286f, 0.995225399986245f, -0.460846026818625f, 0.904552069467540f, 0.807270804870602f, -0.842962924665094f, -0.923108139392625f, -0.130295037856512f, 0.760624035683226f, 0.986419847047289f, -0.959218334866074f, -0.203345611185410f, -0.474420035241129f, -0.872329912560413f, 0.485994152094788f, -0.515456811755484f, -0.948541161235413f, 0.509659433909651f, 0.783030335970347f, -4.41004028146619e-05f, -0.664795573083349f, 0.917509788523214f, -0.824045573084530f, -0.461857767121051f, -0.667434409929092f, -0.00822974230444418f, 0.825606347148302f, -0.396378080991589f, 0.0161379983198293f, -0.940751675506308f, -0.520997013834332f, -0.239727035024153f, -0.354546027474561f, 0.430652211989940f, -0.557416557692462f, -0.357117274957257f, -0.891975448321656f, -0.0775302131779423f, 0.716775563686830f, -0.903453980341467f, 0.946455001410598f, -0.615060907661003f, 0.964288374469340f, 0.0506144897273089f, 0.720601612869967f, -0.991323837622476f, 0.647403093538608f, -0.400304988135589f, -0.883732066109751f, -0.792060477777513f, 0.710867542231890f, -0.840766000234525f, 0.460362174479788f, -0.834771343071341f, -0.329399142231491f, -0.139853203297018f, -0.760035442359396f, -0.546795911275364f, -0.598172518777125f, 0.244198671304740f, 0.0816980976432087f, -0.978470883754859f, -0.425173722072458f, -0.469868865988971f, 0.847396146045236f, 0.0513388454446360f, -0.545662072513986f, -0.130534232821355f, -0.654100097045099f, 0.0409163969999120f, 0.573001152600502f, 0.706046270983569f, 0.587208280138624f, 0.237670099964068f, 0.848355476872244f, -0.318971649676775f, -0.659343733364940f, 0.321817022392701f, -0.595779268050966f, -0.114109784140171f, 0.998897482902424f, -0.615792624357560f, -0.384232465470235f, 0.156963634764123f, 0.499645454164798f, -0.627603624482829f, 0.169440948996654f, 0.109888994819522f, -0.492231461622548f, -0.463014567947703f, 0.825436145613203f, -0.0271223123229367f, 0.497887971992266f, 0.811868354230459f, -0.192668816770168f, 0.287930938097264f, 0.0283112173817568f, 0.791359470942568f, 0.365100854153897f, -0.566922537281877f, 0.915510517906894f, 0.674211624006981f, 0.505848146007678f, 0.509348889158374f, -0.0477364348461706f, 0.409703628204478f, -0.820970358007873f, -0.565377675052345f, 0.810052924776160f, -0.448904038826591f, -0.830251135876445f, -0.660589978662428f, -0.890196028167542f, 0.130526506200048f, 0.924600157422957f, 0.587215078998604f, 0.727552064386916f, -0.224172021948978f, -0.182984019951690f, 0.308546229024235f, 0.971188035736775f, 0.0229902398155457f, 0.0608728749867729f, -0.0712317776940203f, 0.549832674352445f, -0.600015690750697f, -0.0495103483291919f, -0.564669458296125f, 0.726873201108802f, -0.197851942682556f, -0.983422510445155f, -0.905314463127421f, 0.453289030588920f, 0.792504915504518f, -0.840826310621539f, 0.0979339624518987f, -0.506416975007688f, -0.143310751135128f, -0.451251909709310f, -0.356156486602212f, -0.430777119656356f, -0.593002001098269f, -0.212505135257792f, -0.378005313269430f, 0.516460778234704f, -0.574171750919822f, -0.702870049350445f, 0.190454765104412f, 0.694962035659523f, 0.177498499962424f, -0.00126954773922439f, -0.766110586126502f, -0.769862303237397f, -0.208905136673906f, 0.0728026097773338f, -0.467480087700933f, -0.368839893652514f, -0.608806955889496f, -0.531329879815774f, 0.411920547737697f, -0.407318902586407f, 0.922406353838750f, -0.0272310683929855f, 0.781051179942937f, 0.860271807949640f, -0.703736733439623f, -0.285650334863399f, -0.466904334435873f, -0.716816768536707f, 0.0869377378786880f, -0.280331892461309f, 0.773946156883160f, -0.139856444064730f, 0.575680110908147f, -0.887887626173303f, 0.314286545048942f, 0.673119170729964f, 0.520399233930039f, 0.581347801663144f, 0.731708017815653f, 0.672583525027818f, -0.0534590776637494f, -0.880572908687369f, 0.171150522778545f, -0.377041265530122f, -0.478003213002057f, 0.458602883802583f, 0.836824527658741f, -0.0686622680764437f, -0.301000630566919f, -0.652562984155554f, 0.604631263268903f, 0.791770979838877f, 0.0790491584346489f, 0.812646960034949f, 0.138794042671596f, 0.709411730079774f, 0.226484869016811f, 0.797388098554019f, -0.162225991160828f, -0.0295749256270541f, 0.218242165083417f, 0.442845427695148f, -0.480622209857766f, 0.873464432574125f, -0.868017543466245f, -0.435489784247438f, 0.0589001507244313f, 0.829134536020168f, 0.614063504046069f, -0.0498036542372153f, -0.803122689381969f, -0.495207870035615f, -0.126836582496751f, -0.0715271574335641f, -0.600815700055194f, 0.434993547671690f, -0.891665893518364f, 0.515259516482513f, 0.475325173737397f, -0.716548558025405f, -0.881097306400870f, 0.738462585443836f, -0.244486212870867f, -0.750368936394211f, 0.303496411011494f, -0.602701428305057f, -0.400346153635480f, -0.300002744969481f, -0.518552440201900f, 0.437964598712580f, -0.816689813412280f, -0.814392666138757f, -0.888568091915377f, 0.449416911306476f, -0.231889259488176f, 0.589775175288682f, 0.817224890217553f, 0.518646001325967f, -0.406046689874425f, -0.822100925750380f, 0.0528571826460145f, 0.502410576690672f, -0.795964394123106f, 0.0587614583641718f, -0.960750994569408f, 0.0366871534513058f, 0.723018804498087f, 0.0607565140068052f, 0.337380735516841f, 0.810682513202583f, -0.636743814403438f, 0.287171363373943f, -0.651998050401509f, -0.913606366413836f, 0.642186273694795f, -0.197674788034638f, -0.261253290776174f, 0.696450222503413f, -0.178859131737947f, -0.388167582041093f, -0.0593965887764258f, -0.638517356081890f, 0.804955770174156f, 0.220726627737384f, 0.263712659676167f, -0.214285245576410f, -0.267640297291737f, -0.268009369634837f, -0.957726158424482f, 0.708674977585603f, 0.336764494287156f, -0.985742981232916f, -0.883053422617300f, 0.560301189759340f, -0.692967747323003f, 0.977419052658484f, 0.0749830817523358f, 0.916618822945019f, 0.941660769630849f, 0.454145712080114f, 0.176036352526593f, 0.103229925297037f, 0.936507745325933f, -0.870159095287666f, -0.106465234217744f, 0.684178938709319f, 0.669775326656340f, -0.620857222834950f, 0.939074959093680f, -0.592224920792423f, 0.620706594809134f, 0.0456831422421473f, 0.738727999152789f, -0.751090911501446f, 0.683669216540363f, 0.153825621938168f, -0.255671723273688f, -0.773772764499189f, -0.667753952059522f, 0.887641972124558f, -0.664358118222428f, 0.512196622998674f, -0.0234362604874272f, 0.942878420215240f, -0.406617487191566f, -0.140379594627198f, -0.0587253931185765f, 0.419570878799757f, 0.533674656399007f, 0.108777047479414f, -0.695880604462579f, 0.481525582104998f, 0.511165135231064f, 0.136105196996658f, -0.481918536916982f, 0.757546893769363f, 0.957648176032083f, -0.908743619686586f, -0.395640537583668f, 0.0493439519763970f, 0.293569612893396f, 0.387420368421925f, 0.0928482742403196f, 0.407302666835821f, -0.787979245337637f, -0.968269218296593f, -0.409517247978962f, 0.775076200793689f, -0.217738166217447f, -0.370002483875998f, -0.570975789421316f, 0.844070553036478f, 0.668620483679341f, 0.00139813137293987f, -0.0912495442122028f, -0.0375370940595317f, 0.723007849224616f, 0.369999774115317f, 0.862240371150479f, 0.749525689790910f, 0.742992309993137f, -0.495813719545874f, -0.101947508108870f, -0.152536889610560f, 0.0598123624723883f, -0.436496899502871f, 0.520026918467263f, 0.241005798945400f, 0.970456690492966f, -0.376417224463442f, 0.614223236672359f, 0.336733945081746f, 0.376602027190701f, 0.00373987228923456f, -0.415425448787442f, 0.330560415319813f, -0.277250467297048f, 0.861008806111330f, -0.00655914035278493f, 0.810375656135324f, -0.0113631690466840f, -0.191699616402287f, -0.808952204107388f, 0.813180054552450f, 0.472985418265257f, 0.180147510998781f, -0.262580568975063f, 0.211152909221457f, -0.882514639604489f, -0.575589191561861f, 0.106927561961233f, 0.964591320892138f, 0.738192954342001f, 0.687649298588472f, -0.229142519883570f, -0.354434619656716f, -0.420522788056562f, 0.684638470896597f, -0.608080686160634f, 0.172668231197353f, 0.571295073068563f, -0.202258974457565f, 0.183035733721930f, -0.425589835248751f, -0.181955831301366f, 0.798193178080558f, -0.719799491928433f, -0.376418218727565f, 0.100370714244854f, -0.674685331738723f, -0.528950922374114f, 0.480443520097694f, 0.432497368954013f, 0.887439714903326f, 0.598241701759478f, -0.250064970303242f, -0.743111010477448f, 0.936189907099845f, -0.867383557331633f, 0.852536175309851f, -0.426378707286007f, 0.793838638663137f, 0.856262917294594f, 0.734157059815547f, 0.00452009494051664f, -0.884258713402709f, -0.0835595438259760f, -0.735457210599502f, -0.710727075357488f, 0.858050351034768f, -0.626070522205317f, -0.848201957131499f, 0.0180933910837406f, -0.0350884878366737f, -0.893836321618480f, -0.0682788306189803f, -0.539993219329871f, -0.557660404374917f, 0.268969847256868f, 0.505363999910409f, -0.0464757944714727f, -0.529689906951922,
-0.138445378586710f, 0.992531054118938f, 0.974585450054910f, 0.940349645687053f, 0.648085319100986f, -0.410736404028701f, 0.804131759246012f, -0.774897101314247f, 0.178246382655493f, -0.361699623232501f, -0.836093509684016f, 0.806309487627613f, -0.758182371322663f, 0.718410035716663f, -0.213136487421868f, -0.0563465521625497f, 0.0411192849612654f, -0.532497330327019f, -0.0419839515250475f, 0.769432068229678f, 0.253556234192255f, -0.745131216530268f, -0.890639235422577f, -0.140643637034330f, 0.318127074868768f, -0.497415632768561f, -0.383508820416842f, -0.468783454456628f, -0.289531078129000f, -0.0831555730758713f, 0.0107128404847427f, -0.567754537918270f, 0.926366772604370f, -0.600154724486768f, -0.0920759547805206f, 0.889582307602381f, -0.0710437157605615f, -0.182724716112986f, 0.228135065644420f, 0.851015495602628f, 0.653035806598961f, -0.986676404958677f, -0.871714951288816f, -0.824734086356281f, -0.490239304888267f, 0.244318295619814f, -0.923794688606381f, 0.670566388343457f, 0.849438492633058f, -0.225318912425116f, 0.461075616917687f, 0.656436404012820f, -0.416403369651597f, 0.205630417444150f, -0.163509095777762f, -0.0670299490212758f, -0.315561491397908f, -0.0952855008191476f, -0.377993693497066f, 0.860172853824826f, -0.669622978211317f, 0.595058880455053f, -0.425661849490015f, -0.0405359106780283f, 0.129968697438974f, -0.156244199842099f, 0.996996665434629f, -0.888570357356090f, -0.925646614993414f, -0.753998082238076f, 0.714491335460749f, -0.307849905639463f, 0.536274323586448f, -0.462944722411129f, 0.622202376598447f, -0.215582012734053f, -0.115115003363232f, 0.128168110175570f, -0.556263623663708f, 0.921813264386344f, -0.288173574121268f, -0.175054002159610f, 0.0621862747516269f, -0.468862899314091f, 0.976184545317535f, 0.468469061953779f, 0.679394669665911f, -0.0651943232114096f, 0.872740953203360f, -0.917720162541254f, 0.271535917769933f, 0.265441861283112f, 0.542190484993772f, -0.0208550501604048f, 0.983272473294640f, -0.522164666401537f, 0.833823680455458f, 0.414337644113416f, 0.588576354535126f, 0.318369292694380f, 0.870442561030567f, -0.422722224743553f, -0.200185003922166f, -0.770185495487048f, -0.878134057034045f, -0.712873198675798f, 0.647706512601268f, 0.593648188899773f, 0.126171748161942f, -0.189622212946038f, 0.707877641788638f, 0.790070498218410f, 0.698576567863428f, 0.594748885238005f, 0.567439045931572f, -0.591839707769224f, -0.632709967090349f, 0.415471238430617f, 0.115403276784208f, -0.375797954748234f, 0.123611001678020f, -0.864109581464288f, 0.115346512920739f, -0.515581940111704f, 0.880606114362175f, 0.356011740142007f, -0.318112820131587f, 0.765766689783476f, -0.226772670084743f, 0.442067390135885f, 0.348547568069751f, 0.862154389627291f, -0.894863284060244f, 0.475714942110286f, 0.552377629980789f, -0.0838875341374268f, -0.227654706745770f, 0.0998522598030438f, 0.870812229993830f, -0.518250234958224f, -0.0635791579471283f, -0.284101882205902f, -0.454751668241269f, 0.720773434493943f, 0.0756117818245317f, -0.0572317848090118f, -0.692584830354208f, 0.776250173796276f, 0.514052484701885f, 0.00770839936587864f, 0.775668871262837f, 0.933055956393907f, 0.0501713700022097f, -0.922194089981246f, 0.266653852930886f, -0.408584553416038f, 0.797066793752635f, -0.785570848747099f, 0.931403610887599f, 0.660859952465710f, -0.630963871875185f, -0.673000673345695f, 0.518897255252506f, -0.342041914345720f, 0.405613809903414f, -0.373516504843492f, -0.208292396009356f, 0.0510871025610438f, 0.396765368381847f, 0.00537609874241829f, 0.935717099427788f, -0.564801066383885f, -0.907523685862547f, 0.670551481631625f, -0.457309616171932f, 0.364001526470449f, 0.140805524345232f, -0.349945327329409f, -0.0361532758624807f, -0.304268551311720f, 0.618482952755668f, -0.0120110524971313f, 0.106364353621731f, -0.427587198043230f, 0.464249033810121f, -0.808297048471569f, 0.675277128303038f, -0.0663762607268352f, -0.431951364170808f, 0.953951718476660f, -0.725934553905574f, -0.685163723789561f, 0.164132617720945f, 0.934798872032034f, -0.695343627424553f, -0.420317401094920f, -0.689247558220342f, -0.605894279765940f, -0.693832779320227f, 0.455037128281788f, 0.968645000038447f, -0.0839147410947130f, 0.603463489419899f, 0.776913738299999f, -0.491560292499776f, 0.692235227850848f, 0.0824017593921889f, 0.459024952691847f, -0.918050509352710f, -0.777463066447746f, -0.161045596440278f, 0.982603547894360f, 0.700884888820475f, 0.998304481713913f, -0.362488733430088f, 0.171493948866881f, 0.565871153533442f, -0.965620428705067f, -0.835532968802398f, 0.885598629033760f, 0.609604257914327f, 0.725300244775050f, 0.153524048564152f, -0.662541112390878f, 0.912145212201290f, 0.135610445338421f, -0.0813934125800109f, 0.242209063597546f, -0.264886126609115f, -0.335070345839122f, 0.823958964903978f, -0.313110855907701f, -0.354068037633970f, -0.0381190024996405f, 0.117794735211134f, -0.604442743379238f, 0.524930955656444f, -0.754959642694882f, -0.359151666678207f, -0.247910739722172f, 0.573570999369016f, 0.543167570010806f, -0.718553346110069f, 0.202415372555816f, -0.860091438569300f, -0.0125446132328610f, 0.509348782140749f, 0.349261188228469f, 0.424395913611831f, 0.0557092265870811f, 0.740276822496471f, 0.479158001215769f, -0.221873518706244f, -0.744883456979009f, 0.393114117430743f, -0.733203119089531f, -0.506531269498885f, -0.505532097672033f, -0.509440981371663f, 0.666118722468113f, 0.0164067375520756f, -0.530276655546078f, 0.786338654343788f, -0.985008085364936f, 0.479988836226036f, -0.233652481382475f, 0.838641098910395f, -0.407379719374768f, -0.314266358910263f, -0.938033692224531f, -0.627320971378707f, -0.229174127295511f, 0.642505983671691f, -0.387855473250297f, 0.360324209821339f, -0.900766206699468f, 0.176676285751262f, 0.833894117554548f, -0.0207873177403817f, -0.202625183820044f, 0.706644325019314f, -0.817922707040537f, -0.242742059004419f, 0.282109349674866f, 0.0164603911954744f, -0.504625902855950f, 0.0415496120997125f, -0.787777778295785f, 0.362588721999523f, -0.371357162843751f, -0.818375262182416f, 0.727779997467707f, -0.836502839702384f, 0.0423869176265037f, -0.283934686546853f, 0.665864224978728f, -0.0428162304637920f, 0.243534621880753f, -0.803789304599586f, 0.570866852088607f, 0.340615579467880f, -0.323456502239327f, 0.403242371952148f, -0.0679158901587793f, -0.866985651416456f, -0.439873628406335f, -0.246357367033863f, 0.436234859832243f, 0.560714706225535f, -0.632564381913014f, -0.316451076258298f, -0.977122780282003f, 0.0741405862954117f, -0.217862250253606f, 0.887093089232476f, -0.418281865182365f, -0.638553415535034f, -0.262631979211197f, -0.567499176465252f, 0.676178859605923f, 0.933551699581608f, -0.0139735129263516f, -0.610719575803582f, 0.565123751720690f, 0.230672823422021f, 0.323935439339366f, 0.635142215896104f, 0.981184609133698f, 0.883668802319366f, -0.281281673616891f, 0.583204242495555f, 0.150854689098149f, -0.775890223139644f, 0.419951701513177f, -0.565767744791652f, -0.855232478054420f, 0.472188579901153f, -0.501463211798228f, 0.727960518524943f, 0.977187851385321f, 0.908113737694915f, -0.570200931535418f, 0.716036980035073f, 0.147838037485588f, 0.218820342222622f, -0.0673193461152677f, 0.433612519652386f, 0.449601736390411f, 0.556458722303960f, 0.417345590820787f, -0.783345413347895f, 0.858903187230710f, 0.178354025272247f, -0.130619018471658f, 0.858282827806003f, 0.508916167873459f, 0.139535936201634f, 0.240400109521332f, -0.102942705407161f, 0.841682417072375f, -0.696350979494975f, -0.793644449061670f, -0.698273636720141f, -0.228676865074326f, -0.195917865828574f, -0.306483109792438f, -0.865320326812636f, 0.659185969805107f, -0.368847387975239f, 0.337343722359231f, 0.0723822170210744f, 0.907475280998826f, 0.515168301614856f, 0.0790167120323961f, -0.756697420780699f, 0.966477562469936f, -0.663190129982788f, 0.145761851826854f, 0.376079225193173f, 0.631883071958707f, -0.956568110802436f, -0.735990864315730f, -0.795999578321461f, 0.958459465243432f, 0.319180429028702f, -0.907664654881857f, 0.992381284978014f, -0.511208110440365f, -0.714797966909523f, -0.717021870210999f, 0.545775837604423f, -0.0443828768329362f, 0.333311879948434f, 0.617237628406207f, -0.0895192882305207f, 0.506491005527430f, -0.354205929841282f, 0.777993157224477f, -0.667532693120319f, -0.105006112097613f, -0.337191911902220f, -0.337964429160738f, 0.609014812897482f, -0.368922911475613f, 0.889184378947484f, -0.676392242654630f, 0.429716870038086f, 0.916751115281822f, -0.655611878274175f, 0.538928395264007f, 0.382674384886170f, 0.0580742902089004f, -0.0124611362991478f, -0.0240388340005702f, -0.726296501832402f, -0.805701334732693f, 0.945344279474230f, -0.668066000378724f, 0.761436128738929f, -0.314275650172792f, -0.394331510439346f, 0.262887592668013f, 0.155064800148016f, -0.561829218656134f, -0.491542446753775f, 0.922248338472926f, 0.574575887413700f, 0.631722295929094f, -0.368854197209698f, 0.984780657580794f, 0.845286034922662f, -0.965631634115590f, -0.435710392440405f, -0.616488688868478f, 0.885865616625930f, 0.425733070487506f, 0.776721663555227f, -0.0652930284860209f, -0.734431875923792f, 0.725517937762654f, -0.474146253075108f, 0.895357779508529f, -0.0725048758018345f, -0.360185856190223f, 0.559350280666427f, 0.363695103660096f, 0.152231254765544f, 0.698196273442671f, 0.0518001104801953f, -0.139037096279713f, 0.340637636595997f, 0.584243998596814f, -0.442304329829130f, -0.501574294329747f, 0.250155103662225f, 0.320493999001502f, -0.150217982700108f, -0.0381390799255577f, 0.734760815545772f, -0.574574233376749f, 0.593440338163725f, 0.408049858247104f, -0.0845023181203484f, -0.855507806920297f, -0.473198309372409f, 0.331033392104072f, 0.196445364460658f, -0.799745050834061f, -0.973517526224363f, 0.333748727500822f, -0.772356831553232f, -0.430793038424357f, 0.649852557262489f, 0.504357958431509f, 0.779588082810134f, 0.0111847677569461f, -0.995526851285634f, -0.676007517368195f, 0.216774012875664f, -0.618928775636485f, -0.418043155155598f, -0.532063904545563f, -0.566979013994587f, 0.246319907266774f, 0.868651379198082f, -0.0433430896891542f, 0.463004686009427f, -0.162112430964754f, 0.285379745117090f, 0.901512987149549f, -0.706916206313139f, 0.685678130935725f, -0.673017501666538f, 0.0616272859909088f, 0.147532779463338f, -0.0108539826652629f, 0.960841184863269f, -0.950190006701182f, 0.992171414792924f, 0.715577145884581,
0.975908103138584f, -0.769014520827696f, -0.463212420186382f, -0.0761813427220397f, -0.704830850508594f, -0.220579724380686f, 0.840893269946637f, -0.432181989863148f, -0.956790418498701f, 0.122344784859397f, -0.242133592220528f, 0.908514497715246f, 0.303653521236872f, 0.756500828196849f, -0.752207807361831f, 0.367894642791072f, -0.702474131286247f, 0.189226989057138f, 0.401804209353236f, 0.608493473010907f, -0.437378101171900f, -0.158801297891213f, -0.381027984311046f, -0.949403985394057f, 0.370189685252539f, -0.872655295458655f, -0.337934909993878f, -0.0619622888328213f, 0.352094440420005f, 0.128759637109350f, 0.432413186229881f, -0.497474226759161f, 0.552933107875735f, 0.332665936587804f, -0.559261497212156f, -0.886188834336549f, 0.0170548801295034f, 0.192729852728271f, -0.674432365770129f, -0.526014722983374f, 0.425009223123802f, -0.186164676538888f, 0.190362042383007f, -0.0930204201587825f, 0.794188212052413f, -0.243549629178106f, 0.118970185744958f, -0.216230226310237f, 0.412570247218594f, 0.659556685538155f, -0.150540425515543f, -0.850858266540316f, -0.843827815842486f, 0.629298164439457f, 0.944304062363374f, -0.117764731240517f, 0.558568737697335f, 0.731745392387362f, -0.00413812760139165f, -0.251933493011685f, -0.473346352965658f, 0.178783613032362f, 0.547769344759580f, -0.414330113592064f, -0.550251453379012f, -0.925253680779905f, 0.623832825809309f, -0.494251081521428f, 0.0643361026845244f, 0.727107898350051f, 0.814864886916156f, 0.0177325632172460f, 0.749324691554934f, -0.266301024849295f, 0.675202550635588f, -0.0748462128620644f, -0.747853513216831f, -0.222563643557406f, -0.608884446788701f, -0.0374135649675464f, 0.852579123003940f, -0.585927920129879f, 0.604065857569210f, 0.573072924781108f, 0.816831955879520f, 0.723975232584095f, 0.367887024581694f, 0.765292601085641f, 0.836490699448589f, 0.623434131440044f, 0.743568762340577f, 0.140474444458222f, -0.746327891490507f, 0.700496422194197f, 0.549693846244016f, 0.729372970291116f, 0.728185563682229f, -0.614909046853182f, -0.756209631211223f, -0.530222413502955f, -0.312453162783936f, -0.752364704008701f, -0.634475515424180f, -0.133239439768175f, 0.252790153178337f, 0.760626105409900f, -0.838262213452153f, -0.266093046689486f, 0.549339088324875f, -0.278178592347115f, 0.190458706141960f, 0.906814275056971f, -0.579827980376046f, -0.134191470195968f, 0.244720998349483f, 0.795502128014338f, 0.287019836683889f, -0.906277889518234f, -0.817071933038363f, 0.613378274793081f, 0.518208081766432f, -0.388902790616382f, -0.785778461147273f, 0.574976429920521f, -0.283168065839246f, -0.857322381041868f, 0.424932015236353f, 0.919756642423073f, 0.412896759578072f, -0.976511020897041f, 0.157825653359643f, -0.0606591903280758f, 0.508438714729350f, -0.513115001652116f, 0.881391940997543f, -0.129708782033534f, 0.382462819411800f, -0.538751535594113f, 0.816770663497783f, 0.869013288394013f, -0.728381721932439f, -0.956736333819522f, -0.839107107637575f, 0.394821058517234f, 0.721983518815999f, -0.0847231453556103f, 0.0206545030491683f, 0.414707730497861f, 0.246591855656934f, -0.546187573590839f, -0.578957978692654f, 0.162844799084821f, 0.493731081270802f, -0.765815587549615f, 0.151613093585910f, -0.112883397239635f, 0.879319928900002f, 0.295375250614654f, -0.505370201033860f, -0.635319167339584f, -0.309818465920078f, 0.768627024018538f, -0.544374452091825f, 0.758974060573473f, -0.106050973670013f, 0.508616501970226f, -0.207224226211215f, 0.616842248601645f, 0.688381226662374f, 0.643728558619948f, -0.906982649598668f, 0.526262112978799f, -0.666644270400075f, 0.314806313630502f, -0.292000096972562f, -0.358353880616007f, 0.156344541906829f, 0.637606941586786f, -0.199572501073669f, -0.669369278061572f, 0.237513395315133f, -0.576741807179552f, 0.0750117203638310f, -0.633877533594996f, 0.829285089669934f, 0.622345234313277f, -0.892617583855908f, -0.280449892200797f, 0.241147361581176f, -0.0784016295955696f, 0.414945819313502f, 0.287238318044040f, -0.691458270387106f, 0.597656137422422f, 0.549022082569726f, -0.590776624040652f, 0.666740423918019f, -0.743115212424850f, 0.164036350785269f, -0.229427480781113f, 0.283602991107853f, -0.533993445778340f, 0.185806116700093f, -0.317953364055307f, 0.140412503708198f, 0.280706883979940f, 0.0439806827213221f, 0.176471515460512f, -0.614144204292693f, 0.314194083857125f, 0.519572839644130f, -0.850547081260782f, -0.515460990713008f, 0.353087995032390f, -0.0241014119925820f, 0.269453276643829f, -0.608515317887958f, -0.777818225534647f, -0.834277444316067f, -0.842707175235771f, -0.929547602540323f, -0.884691870945475f, 0.710591809809692f, 0.143423776629673f, 0.797136471728128f, 0.233311155245426f, -0.923169961754164f, 0.627911916101674f, -0.338187201367212f, 0.211044396110784f, -0.443699655795038f, 0.256593551969761f, -0.406688684034041f, 0.364900889856600f, 0.900530571350288f, -0.160476177153537f, 0.0634217008071056f, 0.709241599309354f, -0.789562037599596f, 0.00891621061029158f, 0.801674768895422f, -0.704378031949125f, 0.430576706378041f, 0.796937507044124f, -0.193348850174576f, -0.493924902919358f, -0.935781577118986f, 0.468142331108629f, 0.00965840085728753f, 0.0834398764999438f, 0.599712941235232f, -0.735675950275295f, 0.200152501800787f, -0.751603779675650f, 0.0697488403240092f, 0.300634243862625f, -0.901969784333300f, -0.958816237033024f, -0.754976119377363f, 0.719702182489622f, -0.338038642556184f, -0.703280944186943f, -0.579148694005994f, 0.556115731092296f, -0.920710928208685f, -0.278178108839470f, -0.793795308512285f, 0.916547680808212f, 0.419467216101691f, 0.177932177026735f, 0.682833725334600f, -0.926849803428705f, 0.179045225389745f, -0.209414969718359f, -0.889551871881532f, 0.961659420127890f, -0.250341627298645f, 0.105606170554974f, -0.547860346689080f, 0.845704098204057f, 0.886892635683680f, 0.768134466622042f, -0.954777823503721f, -0.718106389777233f, -0.580779231998609f, -0.0241800476518665f, 0.815063484178525f, -0.351971452344303f, 0.770369263680192f, 0.520886146470712f, -0.236456125482696f, 0.0900173391919312f, -0.00610611501589697f, 0.0986788038317752f, 0.277083194173223f, 0.0877085076786761f, 0.695814138412262f, 0.281021332783082f, -0.701468161850407f, -0.785496560046616f, -0.805623403379156f, -0.0524204125046179f, 0.0836418099696601f, 0.467252832788807f, 0.148967572323544f, 0.314141193557124f, -0.722297309069329f, 0.147068590429361f, -0.868307069306109f, 0.118712645744921f, 0.737896544941878f, 0.897526485681248f, 0.842207508585120f, 0.817408479766998f, 0.522315328909182f, -0.409136979179218f, 0.580654760034574f, -0.384701243761730f, -0.769398544059918f, -0.791317178699730f, 0.357020281620118f, -0.235410423267782f, -0.326332500533018f, -0.416891876268284f, -0.863029987000052f, 0.505171215727166f, -0.728709553380428f, 0.554546891580919f, 0.737429989077498f, -0.355088598334119f, 0.911987317939763f, 0.525846127625130f, 0.851549830104189f, -0.772303673276796f, 0.0421942169353806f, -0.521836640530782f, 0.995279650924240f, -0.186831960875832f, 0.421233670121556f, -0.0891583750230474f, 0.661100169663965f, 0.393809652414978f, 0.346165179707090f, 0.384203760628548f, -0.329281932973211f, 0.446133401546675f, -0.748200766224366f, -0.0275154142375615f, 0.771701580845288f, -0.0177829993094090f, 0.406813206251131f, 0.606021648140155f, 0.218435152341115f, 0.236571855064013f, -0.513495776515847f, 0.729086381137554f, -0.137775825035815f, 0.0320966747364262f, -0.313487802206023f, 0.105472520924239f, 0.423606700821375f, -0.231301628369264f, 0.465218832919270f, 0.379671652150568f, -0.00497780485272159f, 0.509290230688327f, 0.467240127182068f, 0.353587964503845f, 0.390455232684039f, 0.721536288927627f, -0.838922323815237f, 0.827628029266859f, 0.768844149796201f, -0.813963144642386f, -0.797054297232628f, -0.933039367361175f, -0.0723957249866136f, -0.664824147893300f, 0.695914840901794f, -0.206071660300270f, 0.879389414398409f, 0.181872681691416f, -0.582831210733033f, 0.624249199449935f, 0.204959730900228f, 0.354831594370532f, 0.337152636438178f, 0.596132114241829f, -0.295619496794481f, -0.443402055665686f, 0.743995051028396f, 0.543706744165365f, 0.825846155044062f, -0.764982315603181f, -0.0355223730700034f, -0.682467026736627f, -0.914037445162109f, -0.222823484413727f, 0.825323277024566f, 0.0769459194171547f, 0.696453968928934f, 0.760786120466962f, -0.525470048583831f, 0.764981036001869f, 0.458525204937000f, -0.612703584870878f, 0.626016142683351f, 0.284799326870320f, -0.130410894642153f, -0.730659587111424f, 0.0251896513929686f, 0.744421417725379f, 0.481278905427271f, -0.718686189713675f, -0.972110566787501f, -0.178005803066219f, -0.761536801353512f, 0.675177569459847f, -0.613068600254845f, -0.854757540148688f, 0.641823580903407f, 0.112536000301536f, 0.201235170163357f, -0.332623522893231f, 0.602028236317460f, 0.487529253813741f, -0.936537443253385f, 0.932862477850079f, -0.0977461167435834f, -0.485449569929182f, -0.575807340541437f, -0.920527242558033f, -0.938208754460503f, 0.890054000488493f, -0.154888511872567f, -0.106629818916523f, 0.323343252623500f, 0.105328135407289f, -0.837197492121459f, 0.497769113944639f, -0.234127101891878f, 0.840922493788059f, -0.994297350473539f, 0.241966031396186f, -0.241143860453769f, -0.598953146106117f, 0.839112451637864f, -0.639567866338402f, -0.219908091959649f, -0.778137266578287f, -0.201424793310289f, -0.486105622640452f, 0.874947034932591f, -0.131437343585340f, -0.674427373037920f, -0.161007203320351f, 0.215285933912207f, -0.963047650748652f, -0.841020847986178f, 0.259702280444602f, -0.165325097679823f, 0.572379756389254f, -0.435802768396928f, -0.0776125194906274f, -0.0293182206559168f, -0.847945015803839f, -0.576891917046364f, 0.728544652294888f, 0.110676857648527f, 0.760459056611184f, 0.486936926897001f, 0.680603035572503f, 0.330358411271561f, 0.901153157113818f, -0.893323547516767f, 0.268679990552354f, 0.794615743189695f, 0.221637368947158f, -0.0207579360252996f, -0.585634995914835f, 0.587646126395593f, -0.317780705107399f, 0.790321547328449f, 0.251610679655279f, -0.0386445267248654f, 0.881542790650722f, -0.469258891944944f, -0.900544881246558f, -0.344978220866601f, -0.271404539202745f, 0.863631450621357f, 0.805892242474368f, -0.325004362330199f, -0.649692260224921f, 0.535815472185538f, 0.427767946389023f, 0.924517987543855f, 0.571059970962007f, 0.549923246060706f, -0.639468249016352,
0.307213071097954f, -0.885892976847170f, -0.526002656640427f, 0.733743042788359f, 0.186919211020217f, 0.322167483598106f, -0.933484010727969f, 0.307181642341518f, -0.391959805653480f, -0.892298105797306f, 0.100065710151584f, -0.932962740784651f, -0.643536993204857f, 0.200747180046148f, 0.310831344540979f, -0.923416823619512f, 0.440768799148345f, -0.666930667413366f, -0.485487251971431f, -0.0627811951952384f, -0.331082293469460f, 0.0335811939608148f, -0.653610782697787f, -0.320586426505716f, 0.559163070852115f, -0.497363452770543f, -0.329886484503569f, -0.146612217140156f, -0.0265272745798242f, -0.288663397675155f, -0.996138396801714f, 0.705746028666908f, 0.634215549629091f, 0.165248482682243f, -0.110791752682943f, -0.0583711657160508f, 0.704663932851230f, 0.105987046073574f, -0.674234600022039f, -0.852792911043127f, 0.779458558047699f, -0.506163961277651f, 0.661431789813829f, 0.362986600662932f, 0.677673397902417f, 0.909704544299484f, -0.678129611146149f, -0.700854916363125f, -0.954905799366644f, 0.819329178422143f, -0.278866438326573f, 0.240572863896085f, -0.597973444252616f, 0.520707363092687f, -0.891796539359942f, -0.0707113684027092f, 0.730270237241197f, -0.202809887987925f, 0.712903235793333f, 0.815918058519912f, -0.619284883130692f, 0.620432327799984f, 0.215462902206797f, 0.913706499476201f, -0.284266999538807f, 0.137669223817851f, -0.320599930994154f, -0.279885143029947f, 0.0759863610502050f, 0.362519848337183f, 0.0897184432777523f, 0.730407126330006f, -0.715664883515070f, -0.964294244830797f, 0.337668374417089f, 0.563780948124681f, 0.534272089774928f, 0.670003495251274f, 0.976582736706313f, -0.576021162432801f, 0.318863740329612f, 0.374838616807691f, 0.437628782275460f, 0.629331465907672f, 0.800673318445353f, -0.964950925853698f, -0.115288102568929f, 0.581179798077059f, 0.892103220665649f, -0.224009831257430f, -0.486848659265476f, 0.768601825625188f, -0.478996958061453f, 0.987216084861456f, -0.00828256241998737f, 0.443388113322642f, -0.209225960405120f, 0.784392408672073f, -0.821157008960409f, 0.169088259578466f, 0.188648958653604f, 0.796321723736402f, 0.804915614204973f, -0.947435972579018f, -0.320368366702004f, -0.0857043727442930f, -0.229914128505395f, -0.802013870592427f, 0.497444368231634f, 0.791040716463223f, 0.586369970276563f, 0.871236424247704f, 0.770091868124107f, -0.458396647683594f, 0.871149873224889f, 0.753895449519495f, 0.295832468734546f, 0.574616471536691f, 0.384408809311353f, -0.978021020306570f, 0.0397482936794495f, 0.628095200786834f, -0.968059492217325f, -0.404306711220928f, 0.659301030460980f, -0.345766174675525f, -0.0517956907600681f, -0.640289082986305f, 0.965202733073502f, 0.909703156044274f, -0.744545066259015f, -0.676836498528477f, 0.0507393165493961f, 0.394673166210436f, 0.250366706754377f, -0.287411651947684f, -0.521760552601739f, 0.214487178617345f, -0.922260536787078f, -0.970217444063294f, -0.632705652784150f, -0.720016326822300f, -0.506393579710801f, 0.774172771450182f, 0.891546338793249f, 0.559706491124446f, -0.513481979527671f, 0.735727350850420f, -0.207760672132971f, 0.956672164225499f, -0.516696999265124f, -0.846015525317730f, -0.199370940530009f, 0.927580907007946f, 0.669786891276299f, -0.208316500739886f, -0.349932032863852f, 0.382722440637189f, -0.455635180187178f, -0.573852668753046f, 0.237990995216907f, -0.00210628303929439f, 0.846035951941252f, 0.921932267818374f, 0.141873820779935f, 0.871317167610738f, -0.632607355185838f, -0.565801401210940f, -0.959881482283947f, -0.732559764685905f, -0.655277252471118f, 0.136770193226314f, 0.206392768880907f, 0.0946932052352707f, -0.147722827344946f, 0.142504821799194f, -0.891443939735724f, -0.660161817562772f, -0.918683225740157f, 0.524851053279394f, -0.841532325411647f, -0.662931925252737f, 0.450018807591706f, 0.157794014139767f, -0.562525486647545f, 0.604051451992330f, 0.859220943805127f, 0.943321402026900f, 0.511188518123118f, -0.332990520726740f, 0.904709059147998f, -0.336911302156504f, -0.0329301811082998f, 0.307263624236174f, -0.640655394434152f, 0.791676792853669f, 0.450137270831791f, 0.746000232170803f, -0.915436267533878f, 0.976514418439799f, 0.828073391112522f, 0.990695018409237f, 0.419713963781614f, -0.286897378037841f, 0.111527193084439f, -0.956913449095442f, 0.263769440437253f, 0.534739246489713f, -0.918314908283506f, 0.680501951418845f, -0.0258330390798596f, -0.696521999550769f, 0.274590593565720f, -0.821334538131451f, 0.104139627465949f, -0.790104923997319f, 0.399265830301725f, 0.118854169469537f, 0.309552488812324f, -0.961100729890863f, -0.665645274594184f, -0.125767140532335f, 0.377154316156289f, -0.971986633153292f, -0.148225730575294f, -0.801072242848910f, 0.735673216754228f, 0.247753694178141f, 0.759093842520115f, -0.529946694334253f, 0.594235069164038f, -0.801015868726278f, 0.141962211231124f, 0.135473683510959f, -0.0431660672944612f, -0.437176231417910f, 0.467008031415084f, 0.324675317141816f, 0.122578305547357f, -0.0351479470228342f, -0.437236315511244f, -0.822621846670407f, 0.989461679354308f, -0.242059902390237f, 0.800837521050356f, -0.387832478851607f, 0.316362161826139f, 0.602440060427024f, 0.890992007298149f, 0.319686042477150f, 0.930326885903916f, -0.170779817104763f, -0.437602177375177f, 0.835764105962134f, 0.522922752459604f, 0.295156847627349f, -0.857646277751538f, -0.451421990712551f, 0.752856133268497f, -0.826193868550830f, -0.906961130052697f, 0.118621494342013f, -0.627099634988204f, 0.163256363060383f, -0.719362770410877f, -0.576563943780491f, -0.369939711177846f, -0.294180430088591f, 0.868430622614485f, 0.945955651201780f, -0.879259966782947f, 0.376142233233261f, -0.549019623646418f, -0.366403875933169f, -0.631308623984507f, -0.398270064613022f, 0.631780765950599f, -0.497821177556814f, -0.0754938097555216f, 0.358298259390762f, -0.438971283619577f, -0.835962846436280f, 0.771544885338102f, 0.132031497593111f, 0.0964144932127649f, -0.171144812197942f, 0.734241841669664f, 0.773828279651661f, 0.591442573315395f, 0.449840299498767f, -0.249196666141921f, 0.910274822633449f, -0.623687862912847f, -0.954398427932048f, 0.700975370671540f, -0.128268698036002f, 0.723971772247224f, -0.239872317271662f, 0.599101633280873f, 0.323504979356466f, 0.726076237951951f, 0.775013638477775f, -0.736157118505210f, 0.681129332563739f, -0.989456914597076f, -0.860559243921100f, -0.652547050354339f, 0.227533741410917f, 0.263244425371628f, -0.412800042549063f, -0.774547399227093f, 0.959749220773555f, 0.0285018454625012f, 0.0260964660594436f, -0.817249773797516f, -0.275510098931589f, -0.957071090655421f, 0.755874233806472f, 0.0601247360044190f, 0.155148678178749f, 0.744458452388040f, 0.206143083045583f, 0.405575258734775f, 0.591273066531951f, -0.286358679634110f, 0.168522523380964f, -0.0740663582251186f, 0.991796969736415f, 0.00304472789286958f, 0.0955103281360055f, 0.595292305224677f, -0.633460800851610f, 0.969720344590438f, -0.788939516987962f, -0.690852963213444f, -0.751849610482179f, -0.454105756229298f, 0.527652178438853f, -0.249156091787771f, -0.395486634371019f, -0.586329259469701f, 0.774216673365643f, 0.000796185912973479f, 0.753872935709907f, 0.691883261316931f, -0.599798140130743f, 0.140718954973018f, 0.400016581571111f, -0.412934563119652f, 0.782683275869451f, -0.837415681080234f, 0.503344297140354f, 0.443222186121185f, -0.869067764953740f, 0.891507832007671f, -0.258782538717313f, -0.592111951047753f, 0.542828422857983f, -0.959476625230936f, -0.373353196174649f, 0.558975637763876f, 0.848608638566440f, -0.861701716955403f, -0.937645215971517f, 0.0456695238513540f, -0.643462752057364f, -0.194887894642735f, 0.576940690214110f, -0.889414400002951f, -0.120401270393403f, 0.581976128201341f, -0.914549817300516f, 0.619675229253819f, -0.446355411157033f, -0.686510097388917f, 0.199022704414501f, 0.0679083509214176f, 0.939286059873160f, 0.919854436895475f, -0.921420499961796f, -0.933865152326639f, -0.173428453947994f, 0.0481843697148709f, 0.282408667923603f, 0.411093542307595f, 0.332739798472214f, -0.539048264159821f, -0.704491312083244f, -0.502163632960363f, 0.955228344617550f, 0.620064399129425f, -0.470222569036376f, 0.754614931250763f, -0.616308595262807f, -0.914574682979899f, 0.624066330640082f, 0.836911269770582f, 0.913639510454430f, 0.653228461676548f, -0.269928008555249f, 0.313006679186127f, 0.984676487220296f, -0.492012769698267f, 0.956868299674771f, 0.291679581317590f, 0.0391808383867289f, 0.572884371819903f, 0.0424011452585180f, 0.955486550514640f, -0.402317209279260f, -0.606465037288902f, 0.547296561663929f, -0.262634118959448f, -0.555413611714328f, -0.328781770154915f, 0.145794994289916f, 0.141260540582646f, -0.451655981927315f, 0.305553535897825f, 0.828724940454557f, 0.263943455052409f, -0.609183422737396f, 0.691170220321907f, -0.372701931956834f, 0.750237424665146f, -0.249353280856890f, 0.379870697565802f, 0.385751069018950f, -0.515117494253264f, 0.716937491491901f, 0.343749563024118f, -0.462962268225808f, -0.542579750084113f, 0.865163879545508f, 0.348358741505572f, -0.309602240547849f, -0.0504864877295679f, -0.822856269672862f, 0.199343960697129f, -0.790668167630170f, -0.0910655952543342f, -0.0243531696455832f, 0.832501734319368f, 0.604933598167068f, 0.899053047900036f, 0.270668041381131f, 0.523691409964688f, -0.0841567002292820f, -0.844392287920523f, -0.910987838261586f, -0.470654231510287f, -0.103828495683496f, 0.253788695977573f, -0.103172947809401f, -0.339896741661867f, -0.447251997825083f, 0.217200476817515f, -0.474840886373359f, 0.227876267254650f, -0.851351819181938f, -0.902078585170911f, 0.445464427415683f, -0.842484493463611f, -0.141606736723087f, 0.104224619207891f, -0.554900879859470f, 0.818556374444811f, -0.832710463532413f, -0.284760316465868f, 0.697962734672817f, 0.235137001970259f, 0.538298155374871f, -0.598477541924834f, -0.833959821954974f, -0.164556670763502f, -0.443902305525605f, 0.484290717235912f, 0.319356252041167f, 0.0834544406255109f, -0.839174383593280f, -0.514784811627172f, 0.466424623987191f, 0.597641402168886f, -0.344706573843316f, 0.346954604803744f, 0.150560726232471f, -0.963838773301094f, -0.210406119881130f, 0.740751216241446f, -0.519896828058978f, 0.882277568799242f, 0.982734995306564f, -0.691486807580351f, -0.120653164608028f, 0.263039860106709f, -0.472131671311566f, -0.469155525952548f, -0.562705921604020f, -0.737502946123759f, 0.151863404645485,
-0.367233093688652f, 0.149585386378220f, -0.152980596399920f, 0.572826412281344f, -0.498718037086228f, -0.0794332639424211f, 0.659760386972575f, -0.574814983564964f, 0.451329484188896f, 0.473066930128670f, -0.135151886005125f, 0.379571405476121f, -0.308712078323501f, -0.136843563834117f, 0.395667583713552f, 0.196238140324408f, 0.588147058383512f, 0.770505301611929f, -0.865188840370228f, 0.266437694165002f, -0.428134513764013f, 0.661967260527446f, -0.752421375452379f, -0.556389852423621f, 0.424944298468302f, -0.480554454112605f, 0.916159659428765f, -0.112147362457396f, 0.363475545209813f, 0.698805683596358f, -0.862382341730295f, -0.489415523853276f, 0.453056404353730f, -0.606183761884457f, -0.00869682692408680f, -0.288739722701460f, 0.487988005841341f, 0.566870040344668f, 0.0894575138005909f, 0.887832293799319f, -0.0981274237649674f, -0.279935090781560f, 0.506891141525948f, 0.952901245338457f, 0.458002767525373f, -0.569410776125351f, 0.849518291873527f, -0.585020953514368f, 0.676037258640625f, 0.299076264841081f, 0.911385441491479f, -0.954959555659035f, -0.681285607891366f, 0.631368118385947f, 0.522268523899537f, 0.900701101674748f, -0.647701850365577f, 0.567960815808216f, -0.138958982219446f, 0.267024801687456f, -0.975771109955874f, 0.314682157086949f, -0.378801381286130f, 0.665990927256163f, -0.573674360032848f, -0.860450785684384f, 0.516581474078532f, -0.190844183471714f, -0.451971355445856f, -0.808113003973650f, 0.860446168028895f, 0.377778958059242f, 0.126949039950121f, -0.892203650250330f, 0.572503460980517f, 0.975224974978800f, -0.202312370945465f, 0.500665599343084f, -0.0510413720986291f, 0.353231752436633f, -0.805555931906752f, -0.199761377956955f, -0.829487282239605f, 0.0282459088867508f, 0.814545057118991f, 0.557652277921578f, 0.613951716518862f, -0.678811366342345f, 0.896500288318877f, -0.627622562398925f, 0.802545092571611f, 0.211382709497062f, -0.979380222642662f, 0.826784411456488f, -0.670689878657734f, 0.788878029765924f, 0.137070906151783f, 0.901907287859132f, -0.526217367070263f, -0.545043827128876f, 0.494756249972086f, 0.236657948774128f, 0.156603327087660f, 0.516397244064118f, -0.325837179590292f, 0.460683385171580f, -0.196022953760504f, -0.441996357332195f, -0.808932369852494f, 0.291980108741838f, -0.833583979826152f, 0.365574438479475f, -0.797139524158001f, -0.0649288183732912f, -0.000696491493834994f, 0.100125393693922f, 0.598035350719377f, -0.312548404453564f, 0.0414605409182345f, -0.675913083156432f, 0.236245026389435f, 0.550464243484224f, 0.193366907856750f, -0.903654015709839f, -0.00993172527377806f, 0.0180900754210873f, 0.880678290110106f, 0.166539520562349f, -0.984509466189118f, 0.810283124477894f, -0.925371921448173f, 0.193528916069728f, -0.748644561903135f, 0.534508666819454f, 0.364436869280188f, -0.386979667637943f, 0.427958998441480f, 0.362750270039032f, 0.420886957715891f, 0.0300301961707390f, -0.655220626875711f, 0.0504522662127427f, 0.472640818703213f, -0.417745816013639f, 0.0689992794158720f, 0.461232479061866f, -0.483517586427718f, -0.411463769964024f, 0.622740736364726f, 0.659687134578680f, 0.243900134982579f, -0.684356227282321f, -0.688699031115733f, -0.316032121634021f, -0.644296362948831f, -0.236133265458216f, 0.880259454885881f, -0.956880609581177f, 0.737775899964131f, -0.529059297472703f, 0.794119601436042f, -0.375698158660466f, 0.493447663117292f, -0.752511119115434f, -0.941143365329844f, 0.610101048864035f, 0.253791011658991f, -0.369994602049336f, -0.697364270085742f, -0.681360550250048f, -0.571943442128960f, -0.749697324128684f, 0.611997629275096f, 0.892727938106141f, -0.440225399106758f, 0.00196047981855352f, 0.951252158369648f, 0.0351885308766962f, -0.471806546113710f, -0.657231535594911f, -0.0873481442406481f, -0.0341288006282565f, 0.579184398564974f, -0.224334624306026f, -0.298557652719061f, -0.509401519638379f, 0.188853505083675f, -0.321619146497229f, -0.613159956450671f, 0.570042044631281f, 0.699213203307007f, 0.537439231469861f, 0.529440733283839f, -0.744527226912905f, 0.362949055807175f, 0.529758698714545f, -0.114804719889245f, 0.991089489396930f, -0.186716454683287f, -0.218189173574106f, -0.0493780858124198f, -0.928812411399224f, -0.101855573638590f, 0.454268528366586f, 0.617591620012079f, -0.197519518988231f, 0.0973277590468935f, -0.185672509894105f, 0.649922648337967f, -0.896862900376972f, 0.594999589349510f, -0.746978997769556f, 0.590642952628647f, 0.935109901616311f, -0.293310684054096f, 0.783281817912060f, -0.189898897214222f, 0.414859016240278f, -0.0858574647662298f, 0.0810260863380805f, -0.633024441577653f, 0.248442861097829f, 0.984586601784679f, 0.982811638387854f, 0.547456083836220f, 0.476239638753291f, -0.897709902882279f, -0.208045489357872f, -0.860637131636973f, -0.496740558564284f, -0.944185351410090f, 0.157610983944341f, 0.975214099838643f, 0.550265718083095f, -0.630360326400067f, 0.672420341653334f, -0.897139264107564f, -0.670556423663785f, 0.298764071000339f, -0.310465384759529f, -0.978153640586955f, 0.189785151994709f, 0.929291975296760f, 0.758271912876084f, 0.806829662560108f, -0.472787451147715f, -0.802032434276146f, 0.455809631085663f, 0.985520713417984f, 0.739637167649794f, 0.311705106454777f, -0.120539152808323f, 0.977785717545631f, -0.848554870988208f, -0.281179241544089f, 0.931102239520177f, -0.255243432382956f, -0.284952242030900f, -0.189341152192864f, 0.647573166562597f, -0.474203015584843f, -0.545915610099538f, 0.672696420688916f, -0.239274489717776f, 0.956544960216021f, -0.0858024073600807f, -0.758223415922611f, -0.00817763648068581f, -0.500893489164054f, -0.669386983409311f, -0.344450617815217f, -0.728051392792875f, 0.804121117816188f, 0.00718436691280910f, 0.195237363230272f, -0.472485206728796f, 0.642070241911164f, -0.272384993247314f, -0.731715323915071f, -0.791266589031733f, 0.0339783427570857f, 0.0696513783219659f, -0.894169486972683f, 0.00234016305501483f, -0.0403382685361653f, -0.943600572111266f, -0.788181603936192f, 0.851406365407377f, -0.100015982664501f, 0.145502229793638f, -0.528736628076536f, -0.0313760382570432f, -0.662221611141088f, -0.885722031379862f, -0.744257140212482f, 0.524976313116033f, 0.186092035304635f, 0.181669793648209f, -0.606482674165339f, 0.849303544554227f, 0.226118051135263f, -0.690025550727719f, -0.256543384397548f, -0.207714017766381f, -0.447913202664626f, 0.375270273897879f, -0.884312586292038f, -0.0838720085819762f, 0.969898436757285f, -0.736808033249456f, 0.668875150485586f, -0.599937439969920f, 0.470077288925414f, 0.903135367105719f, -0.895619185450694f, -0.637694108244489f, 0.572669535020987f, -0.696211470281632f, -0.820577518545193f, 0.937364674938455f, 0.422458818039761f, -0.593964370461091f, -0.586264791612426f, 0.0282373486927521f, 0.298051147134121f, 0.592825359583763f, 0.716195674857467f, -0.684008410968338f, -0.167523841045924f, -0.370794208549223f, 0.768054740581884f, 0.997835641681024f, -0.366262133888883f, -0.523114034556271f, -0.457946740456489f, -0.530941146838744f, 0.298744841822404f, 0.390761228562591f, 0.0871171594445448f, 0.764002674223649f, 0.233966808661423f, -0.116573523634048f, 0.426118986433559f, -0.255934695328716f, 0.302314199650152f, -0.254971729124577f, -0.330865677738578f, -0.0840307537517577f, -0.711910586170446f, 0.622585361690409f, 0.367595248366733f, 0.422102667722561f, 0.269580206097961f, 0.707083822001774f, 0.625367208198523f, -0.729594790471199f, 0.708679674727951f, 0.00355767003560614f, 0.379158300246371f, -0.688791438249760f, 0.261637457245975f, 0.704008781391790f, -0.917586017594177f, 0.886443038824615f, -0.923559496787343f, 0.360365726214756f, 0.547058288460181f, -0.279853192856989f, -0.996331953899586f, -0.323735921605962f, -0.618788277975037f, 0.314597206161166f, 0.106380963133907f, -0.235044228453968f, 0.0406899091091886f, 0.687339428801573f, 0.344837805924860f, 0.123214914005620f, -0.735264225932133f, 0.0396243248944774f, 0.270602083588730f, -0.316104623194235f, 0.201800731173529f, -0.348987679395254f, 0.994312100135549f, -0.986073454140000f, -0.787571177818193f, 0.508460947811657f, -0.443663972776222f, 0.800303477136838f, 0.712158443474503f, 0.958364684407633f, -0.0512343510942759f, -0.391095518504938f, -0.291911155637644f, 0.721770656984705f, -0.163541232110535f, 0.0366644501980513f, 0.700853097239887f, -0.508089885354834f, -0.375072588159867f, 0.161585369564288f, 0.686325557438797f, -0.113188612544717f, 0.859354598908873f, -0.723198679696606f, 0.398879124170303f, 0.139357627051752f, 0.484780500073663f, -0.0437501438537016f, -0.868783676783105f, -0.147865612288567f, -0.116480069295514f, -0.986846049950927f, -0.859405305954576f, -0.631359938031082f, -0.0310065270390489f, -0.288382201791710f, -0.500960878568203f, -0.805633068309090f, -0.837604329816134f, 0.0325253228618525f, -0.538953832190091f, 0.913844038280417f, 0.681967460199437f, -0.656775429658090f, 0.922492558885196f, -0.689527254640680f, 0.688263898240070f, -0.225450858342925f, 0.0287239965989763f, -0.407744573364816f, -0.477326718671529f, -0.780374037627418f, 0.500400378743065f, -0.532646941279704f, 0.999679272201893f, 0.136003002234441f, -0.811267727922649f, -0.585019862511894f, 0.125465493193590f, 0.203160759437510f, -0.101322607820275f, 0.543784310894398f, 0.630139383695983f, 0.775322422120693f, 0.229262447827729f, -0.656821799421711f, 0.795940998463793f, 0.263281283116320f, -0.377237794697631f, -0.714267543277316f, -0.161924029976839f, 0.804294011825499f, -0.500488029613262f, 0.716655543045374f, -0.709565530287520f, -0.260746944768714f, -0.496886497176178f, -0.896154699339640f, -0.891352204187934f, 0.0589172685048254f, -0.952496908556348f, -0.543314015084183f, 0.0724005345282401f, -0.132089156895576f, 0.694937364018361f, -0.884509342587775f, -0.944587795707932f, 0.346949362800262f, -0.587900264454839f, 0.531217960795664f, 0.404240620498887f, 0.182769547944683f, 0.804826966991636f, 0.601398794220406f, -0.767933817870427f, -0.329693990599177f, -0.880648189418561f, 0.0370834298504716f, -0.405270662847564f, -0.551993194163015f, 0.357335885219159f, -0.442910616174561f, -0.978355051725551f, -0.638907517841606f, 0.266841057307734f, 0.778698832906031f, -0.967180516636130f, -0.772940622039654f, -0.268706136695081f, -0.326082261974967f, 0.0386785617389067f, 0.576293286973562f, 0.446884000380730f, 0.396703264915684f, -0.718633572608705f, 0.586041202195072f, -0.791039546767268f, 0.556638124682382,
0.728711593864679f, -0.576551104247230f, 0.690227524206044f, 0.0451432373341216f, -0.0569690667958747f, 0.877674150343795f, -0.268602876493051f, -0.770720641807978f, 0.630269600593677f, 0.801702094819180f, 0.177071915997341f, -0.0764831522886398f, -0.476930347674815f, 0.0196833210809626f, -0.566188434097295f, 0.309890567123613f, -0.642682312350471f, -0.645839718540077f, -0.985031719881713f, 0.153028235575708f, -0.446724738384881f, -0.616280949001367f, -0.306418078463084f, 0.313048512921978f, 0.944732667717825f, -0.292311689238647f, 0.263616032352334f, 0.776777395064071f, -0.529182830991988f, -0.418996105801001f, 0.286960890623362f, 0.588336822287104f, 0.268219370126612f, -0.696727535489037f, 0.806089151192541f, 0.0396168299208206f, -0.613570658239778f, 0.358002315998429f, -0.0576147175733950f, -0.859664908314368f, 0.930793190364908f, -0.108955403960031f, 0.640347446939098f, 0.0301817512477458f, 0.508435547839785f, -0.774928250619894f, 0.254548271045827f, -0.192551571812315f, -0.401867317012389f, -0.136220787532581f, -0.480363308055205f, 0.146599399729624f, 0.225767301672040f, -0.207158678688912f, 0.763491487133281f, 0.161192803873192f, -0.574968151683314f, -0.454043408746924f, 0.427131132989065f, 0.170648543751820f, 0.0690597676805780f, 0.0360172652133248f, -0.244429817416531f, -0.973014074152018f, -0.172642279134011f, -0.798684796670922f, -0.622626145444778f, -0.743408670602069f, -0.316057396003030f, 0.908608689971065f, 0.948356574904685f, 0.573858539226522f, 0.457065605245418f, -0.246203048690671f, -0.750525340546383f, 0.612971646035183f, 0.951528788403619f, -0.529776510809815f, 0.0886901849846271f, -0.0254136796699882f, 0.978897595553096f, 0.293893753097695f, 0.620217642132267f, 0.862352989549627f, -0.379040515436326f, 0.790157871471479f, 0.147151952442201f, 0.688271487774812f, -0.897847532497188f, -0.0355337105008888f, -0.850253422176695f, -0.0354384862653523f, -0.625796807949394f, 0.851730076897135f, 0.294773618291289f, 0.834287219330433f, 0.0758749738551283f, 0.912613321307355f, -0.326698079590551f, -0.844748577890143f, -0.685263599922107f, -0.197029963909655f, 0.591416614029013f, -0.130921826828109f, -0.524292687689084f, 0.356220524225632f, -0.150091552835503f, -0.935232109847821f, -0.302103008478127f, -0.998557516519010f, -0.477012685701094f, -0.882343341754284f, 0.210797034143964f, -0.963566378978947f, -0.855600913755685f, -0.790231379847513f, -0.625235937382084f, 0.106405105589857f, -0.760544427202586f, 0.0103124858505332f, -0.610157345750845f, 0.968354521575116f, 0.602472069136318f, -0.216458111191680f, 0.935180184275450f, -0.369261245032360f, -0.289325139062185f, -0.772389696964545f, -0.345513639348744f, 0.135539262008296f, -0.747409495863324f, -0.849724942811800f, -0.739393030129744f, -0.0301380087411172f, 0.373808817820448f, 0.760444548005323f, -0.365739960428504f, 0.121859476627292f, -0.719257541809299f, -0.136914676340304f, -0.178479405732130f, -0.336676444507223f, -0.795056125367297f, -0.0872862684496700f, -0.950510559362909f, -0.395266512078238f, 0.636773305385949f, -0.150667208767723f, 0.534401287220298f, -0.349371424663528f, -0.784729313810243f, -0.0510904599006878f, -0.938702345462904f, 0.616929636007953f, -0.228578318449040f, 0.239101663221907f, 0.0390879233281141f, -0.294705782740043f, -0.847928516841798f, -0.0480433695823821f, 0.487351505367245f, -0.820736333448301f, 0.128692585024021f, -0.305133215914817f, 0.344900079505924f, -0.764316168982242f, 0.717529584295197f, 0.655848670831377f, 0.479849611138232f, -0.107624564628078f, -0.345816374073252f, 0.0822414215758816f, -0.0120870567528208f, 0.475870901669481f, -0.00594923432583361f, 0.869227669945672f, -0.262862047504512f, 0.272430399676396f, -0.734262318791166f, 0.980593493214018f, 0.110413869658192f, -0.732486564250777f, 0.470756873196238f, 0.897133387901917f, -0.151953973158384f, -0.591296220619271f, -0.113167158942796f, -0.103020520738423f, 0.220384226627647f, -0.0570027879342681f, 0.0923157145066511f, -0.523010309215342f, 0.385053964060568f, -0.223938668105458f, -0.0566497019068211f, 0.636390081595965f, -0.753651530578004f, -0.765450358896516f, 0.790370075460245f, 0.622949415286967f, -0.0947634056426396f, 0.122381201893998f, -0.138573523511105f, -0.544298107235542f, 0.535416341314523f, -0.341107295330707f, 0.266262786345860f, 0.620108481133049f, 0.190424987800150f, 0.978559599202704f, -0.925772919482004f, -0.300038300695816f, 0.963372836978511f, -0.501235224357981f, 0.828375446308031f, -0.595716120481773f, -0.889271354193173f, -0.389843123593065f, 0.659433696092409f, -0.633476165557619f, -0.708607689555741f, -0.737738480460783f, 0.985245299432648f, 0.976853985813928f, -0.863072444190232f, -0.785830171723126f, 0.309433061520758f, 0.166813366328975f, -0.552916412621405f, 0.0385101740167735f, 0.445866961855263f, 0.222557362424800f, 0.0710515871571971f, -0.368563489700928f, 0.317406114361191f, 0.326902000037272f, 0.868261309598320f, -0.897838476369198f, 0.664364291232529f, -0.373333343843574f, -0.599809263387549f, -0.411236387818613f, -0.118186587264933f, 0.544960929851182f, 0.395925813072269f, 0.337332244255533f, -0.0195528742963547f, -0.580383437020279f, 0.0779554182143842f, -0.902635825594202f, -0.821554429188969f, 0.869996816042779f, 0.646142135585380f, -0.0824693320525758f, 0.643317857725100f, -0.903892480205129f, -0.457595546004975f, 0.540461917564665f, -0.467530238695992f, 0.107497588388074f, -0.122360487746121f, -0.276968072230331f, -0.436413500733568f, 0.0719555518906898f, -0.794937479672675f, -0.641344733876686f, -0.934734152781945f, -0.0610463967348016f, -0.302623058375597f, 0.281116298309257f, 0.557459622053789f, -0.350054779110337f, 0.681853624031498f, -0.0454067482892435f, -0.897204174835461f, 0.0289327275291300f, 0.664312739864751f, -0.368814604980581f, -0.576946854776660f, -0.187886132141311f, 0.424385580259236f, 0.257994303715228f, -0.567650112011742f, -0.0453371545575014f, -0.362909825264387f, 0.450095578912812f, -0.713870209574945f, -0.956583539581944f, -0.969891699048729f, -0.417755773448598f, -0.230738535348142f, -0.153353095644968f, 0.539368458440622f, 0.591116036659417f, 0.779095541288385f, -0.578525766017613f, -0.587777137316663f, -0.301051260910212f, -0.319655538885669f, -0.343495369437935f, 0.908167583226333f, 0.764220052027033f, 0.0536418758245909f, -0.0529753241803754f, 0.249066042857931f, -0.840152142252005f, -0.529971459254312f, -0.449462194610696f, 0.467144819001113f, -0.500103828192601f, -0.758390449663076f, 0.369740436821770f, 0.189153926151852f, -0.188283227959439f, -0.427563759945909f, -0.186773725840825f, -0.00989853573399446f, -0.783648829817413f, -0.626450875837851f, -0.328015817185970f, 0.760383401930071f, -0.00804531008117837f, -0.982799468341000f, 0.392730506677802f, 0.117799138097530f, 0.351088974844522f, -0.259750164530173f, 0.776495358243216f, -0.703059519879109f, -0.362866233240751f, -0.421345310205860f, -0.818968876330675f, 0.936887497269786f, 0.713300632813635f, 0.916608801523944f, -0.147818975792564f, 0.317064988534009f, 0.885779227314381f, -0.897706599297367f, 0.685423132064732f, 0.907830438936990f, 0.0636614655685575f, -0.423018627861747f, 0.411565657893159f, 0.911060408474647f, -0.617833142759668f, -0.709543522964145f, -0.817633731247023f, -0.252433983274424f, 0.160456393103956f, -0.160765428576997f, -0.622001061437904f, -0.470257555319641f, 0.790643274059634f, -0.648181378655916f, -0.828694900506363f, -0.0234091767546987f, -0.562865077760768f, 0.369299949506391f, -0.423850142805423f, 0.520699811923658f, -0.877662359466779f, -0.739844704434180f, 0.300520939787139f, 0.0655718600121620f, 0.970843358712180f, -0.634231195336845f, 0.324880041395596f, -0.479089635857354f, -0.196422753715449f, 0.568762754402869f, 0.699215376070842f, 0.445741923102597f, 0.679868900756090f, 0.107609859752086f, -0.980983474461865f, -0.788419140653730f, 0.0696289436185713f, 0.00330944186568516f, 0.392265626672398f, 0.803469542460994f, 0.131029913648810f, -0.845408454497170f, -0.754797811352229f, -0.824208086798235f, 0.510072775586974f, -0.809491727769575f, -0.0228491196350333f, 0.920014947791232f, 0.441066319826495f, 0.969846842038360f, -0.199024726691046f, 0.886564290041856f, 0.203997575245743f, 0.481547443573126f, -0.637742489331117f, 0.0664642070998316f, 0.109187062068770f, -0.952676759642045f, 0.309247049771982f, 0.880534651306060f, -0.269363005485603f, 0.280012695899358f, 0.853031642671923f, -0.216236966392235f, 0.903180305900435f, 0.837949615815047f, 0.748563816043584f, 0.266735542018788f, -0.685176037557414f, 0.505893787666761f, 0.977721983069541f, -0.667151469253569f, -0.451774081267849f, -0.385755850727233f, 0.681037251596535f, 0.550130384863457f, 0.704080312734731f, 0.519624533199220f, 0.789651392050294f, 0.176325856625025f, 0.684011432098839f, -0.469125761119035f, -0.841814129063957f, -0.901473334652527f, -0.117747872709914f, -0.608533033968273f, 0.199709646080986f, -0.349430401438670f, -0.435162733168206f, -0.368150014673779f, 0.699084004342174f, -0.446068942643995f, 0.197420740774886f, 0.524893584115327f, 0.706475758890142f, 0.912020785879679f, -0.820472223153770f, -0.334742316079635f, -0.851724976994477f, -0.702164662784812f, -0.649654462810552f, 0.411435475616403f, -0.0438368033650360f, 0.799231452421757f, 0.713371883779316f, 0.252437083518609f, -0.685658163265283f, 0.0734649179831324f, -0.400549431226783f, -0.415602545578540f, 0.233864615718965f, 0.828846528739923f, 0.606577491175688f, -0.266016048272811f, -0.619106744484090f, -0.690853262778644f, -0.503499724631377f, -0.409761822901473f, 0.0576293548519007f, 0.551582021066584f, 0.132631452787255f, -0.838228405334512f, -0.107475742619267f, -0.875306852866273f, -0.184700469068763f, -0.317074087896838f, -0.580912620700556f, 0.453916157844897f, 0.690470988649940f, 0.712835197480083f, 0.314786689622726f, 0.759835688452120f, -0.671090442836235f, -0.408277610289776f, -0.815988422173708f, 0.227854929660384f, -0.0482646895577266f, 0.968141192561708f, 0.373896367655818f, 0.820435826598941f, 0.817746838197885f, -0.0970819110331989f, 0.679170154451559f, -0.577986561676471f, -0.0523570914231941f, -0.776930151133931f, -0.560456597170701f, 0.927747720961181f, 0.0350177837302503f, 0.844938034137843f, 0.00849044473190053f, 0.325089161670337f, -0.851825175889265f, 0.835251667623832f, -0.266397917890485f, 0.108463887056499f, -0.817868888235156f, 0.590399913800720f, 0.699274619715208,
0.200782223352391f, -0.936155874445214f, 0.218471971175575f, -0.890402779861849f, 0.268496441855317f, 0.881231954583528f, 0.279360358017994f, -0.492400368838405f, -0.894376670076375f, 0.585129064098519f, 0.340135248071744f, 0.455880107692993f, -0.861081993524584f, -0.303321115935151f, -0.562781799622214f, -0.526041750296426f, 0.999581943964160f, 0.249814139040315f, -0.0537475603822974f, -0.845239239849439f, -0.874024176808607f, 0.997751771128387f, -0.861617607547820f, 0.671357923629889f, -0.687974310115279f, -0.969462039056016f, -0.448304961870341f, 0.713064428261850f, -0.00718668165564318f, -0.450608596544700f, -0.106059234376561f, -0.591961308554238f, 0.588633089685867f, -0.755341317752403f, -0.542715401462936f, 0.759199260356047f, 0.0297710796506234f, -0.997343196630657f, 0.574076752994254f, -0.696719940193256f, -0.852227517176613f, 0.906332566627663f, -0.171801252847090f, -0.925131151948528f, -0.0212194634560026f, -0.940316444070044f, 0.262965279952363f, 0.902198615594563f, -0.265057066430189f, 0.161983092277652f, 0.0181345459457500f, 0.467973650469608f, 0.857351800575040f, -0.889882538061811f, 0.728868283859490f, 0.671187732362764f, -0.296882575397444f, -0.793099233276668f, 0.335561922676737f, 0.0671874495572633f, -0.0857142329385701f, -0.352870876674233f, -0.119927139078065f, 0.814127111105761f, -0.323910302649634f, -0.313495077982818f, 0.0690526899468447f, 0.877155536890319f, 0.768040884649443f, 0.158910636324140f, -0.824414709871474f, 0.00718921022841235f, -0.868917281154898f, -0.564967532196669f, 0.206261416621150f, -0.0699574404456100f, -0.0547095858591442f, 0.811674902353136f, -0.562993920383635f, 0.441212008804309f, 0.917951119557396f, 0.915571961092301f, 0.0901952529553498f, 0.614118141118295f, 0.760473529905706f, -0.566505475760865f, 0.00880029006400429f, 0.975626259597421f, 0.370738159620831f, -0.0242162976348563f, 0.828887690189252f, -0.665240810020082f, 0.00123256686221063f, 0.184020074202841f, 0.829917510366750f, -0.447854906466885f, 0.529356328938248f, -0.995192699858126f, -0.843748622724646f, -0.422765372440245f, -0.386179414096638f, 0.206325400140261f, -0.369817591904938f, 0.266933785902425f, 0.892617584642659f, 0.740018647415220f, -0.481907279471296f, 0.248268418729551f, -0.382770749117505f, 0.974424303757207f, -0.879320252286332f, -0.0294961755317245f, 0.638693329623790f, -0.765127178629299f, -0.160881380476610f, -0.725001019123526f, 0.00294709357263234f, -0.701949969294570f, -0.708933381768328f, -0.463893635537772f, 0.476650147791524f, -0.206043208566879f, 0.223011684523516f, -0.258637160422673f, 0.206325908651728f, -0.432336904344548f, 0.921979975841259f, -0.944396630315761f, -0.00680582426415510f, 0.319263487872783f, -0.836389324192867f, 0.111532890274445f, -0.938142383682239f, -0.637288670131655f, -0.834211558255576f, 0.251969378874330f, -0.970874587083192f, 0.831662411079802f, -0.446568187924869f, -0.659109068071113f, -0.877869176622375f, -0.890670252448197f, 0.477602927742628f, 0.324737705007923f, -0.147513413112549f, -0.186594638422632f, -0.282864808082840f, 0.745093922271927f, 0.915500859154332f, 0.0421588655873384f, -0.483320910754088f, 0.00503734690385604f, 0.555792895688253f, 0.129412601050279f, -0.229347983583150f, -0.680101211823600f, -0.866063899229274f, 0.437769924839021f, 0.133958234316391f, 0.589233411145099f, -0.498053917701437f, 0.180863681584405f, 0.525955777469479f, -0.581250985307273f, -0.327934857804250f, 0.482381204171926f, -0.867703472610278f, 0.833733008515087f, -0.607761820334944f, -0.758512235503178f, 0.0380785706067470f, 0.719862150842292f, 0.651283470517919f, -0.614218162858801f, -0.239754124815405f, -0.733992057859951f, -0.422541764223845f, 0.951215428883086f, 0.882569470276544f, 0.937054481646402f, 0.184532408731968f, -0.104097666585483f, 0.693277433170057f, 0.800241936558839f, -0.998230532922071f, 0.259835639125661f, 0.562745639592536f, 0.220441127510705f, 0.313735993201991f, 0.330940415696351f, -0.602872424656300f, 0.841677792852844f, 0.749701489563795f, 0.266727039860087f, 0.696379094133993f, -0.430719144952456f, -0.276768289732264f, -0.0872580230244173f, -0.722033206227688f, -0.837309584159114f, -0.629739366225350f, -0.185692585028452f, -0.110619837317415f, 0.515881116042359f, -0.105875685978079f, -0.513700186568578f, 0.961245417898430f, 0.655513716233953f, -0.0921704793645632f, -0.694925472850399f, -0.872174817305748f, 0.0307133806779607f, 0.531120672076921f, 0.965271277398122f, -0.00974420246777163f, -0.497322783064087f, 0.693565685926388f, 0.546918707342947f, -0.230039497490898f, -0.316024461029338f, 0.684231559582941f, -0.306362794944468f, 0.861366189035942f, 0.378922635334764f, 0.259443877770437f, -0.838617128408830f, -0.205350631644011f, -0.139772960377519f, -0.192918167939180f, 0.602404904043886f, -0.537407583974730f, -0.877007125624351f, 0.361539942609439f, -0.732030207831016f, -0.488792995226420f, 0.612591017966442f, 0.567185560938756f, 0.195543595335781f, -0.428955670554558f, -0.666590144318038f, -0.702467396810860f, -0.894350832807439f, -0.0620405855731709f, -0.583114546325259f, -0.482155957064968f, 0.212152442925647f, 0.112603107288251f, 0.0683986906619714f, 0.639176340917929f, 0.642610005510521f, -0.708605273163374f, 0.739594669131005f, -0.492786220480274f, -0.308196102291547f, 0.918748221553053f, 0.186736140989674f, 0.438437026242591f, 0.638769573344929f, 0.928896220524135f, 0.579945520523175f, 0.218608554904045f, -0.526070140579576f, -0.140303420071590f, 0.304347769360423f, 0.488123173638490f, 0.987207018313181f, -0.536397951752998f, -0.553296120219359f, 0.184294880372153f, -0.101502970339396f, 0.287041514309517f, 0.658172721877726f, -0.270141883431914f, -0.0196021946303913f, 0.000779126872975988f, -0.0500294515684538f, -0.588505226599557f, 0.550916571982769f, 0.703271386531766f, 0.982335628009701f, 0.942133544852489f, 0.690741953320684f, 0.0466423349204477f, -0.941178278727504f, 0.121655023640973f, 0.777925151322362f, 0.132430336075323f, -0.114812120408198f, -0.694094073965245f, -0.441397675924967f, -0.187253074701348f, -0.672248118097589f, -0.688869123609503f, -0.0723581859661586f, 0.553779536791160f, 0.380610143087564f, -0.392032089052147f, -0.709403552653908f, -0.607184251637473f, 0.698227587629545f, -0.272885954851784f, 0.0736609147840435f, 0.687106303730018f, -0.230362931709251f, 0.393640839382244f, -0.846905732907407f, 0.0727598538725249f, -0.0119849190815611f, 0.470122652313157f, -0.171681529301612f, -0.329268850654460f, -0.433013841687086f, -0.943499527192280f, -0.123404693276305f, -0.0861435714812342f, -0.228816973160929f, 0.0531549757963279f, 0.901446101051298f, 0.470738280922993f, 0.238383552115632f, 0.292841887198914f, -0.617423653544601f, -0.865786115828523f, 0.586332203179351f, 0.267618252846898f, 0.888575002575769f, -0.0220649407038027f, -0.946385428026066f, 0.317436113017866f, -0.277195072909682f, -0.207326502081016f, 0.735387675940421f, 0.961386190882120f, -0.564038045970629f, 0.840007249305217f, -0.262593952346269f, -0.556378761937190f, -0.346529850864238f, 0.00895460576800877f, -0.695431082536551f, -0.105261635693881f, -0.658342101938401f, -0.631093613961188f, 0.601639903111316f, 0.886830692209879f, -0.600591324826329f, -0.350296019796741f, 0.294348102011741f, 0.555826495708193f, 0.216370653207427f, -0.672654026881445f, -0.572202359802723f, 0.202776438466314f, -0.490708964058038f, 0.0148723360197853f, -0.799031226692943f, -0.221164759306209f, 0.0323674121757880f, -0.130290693568615f, 0.613592603765503f, 0.372755498065474f, -0.540502917956863f, -0.740021877141017f, 0.652888612951242f, -0.666157898478327f, 0.476156241264794f, -0.632081251666311f, -0.538341981270842f, -0.275717185193560f, 0.332983363477103f, -0.989659450166330f, 0.212868816589688f, -0.238985653168422f, -0.453005976359810f, -0.805975530848911f, -0.948192632970312f, -0.291329963979224f, 0.549811667826684f, 0.291147979443248f, 0.909805561757383f, 0.0728533843443158f, 0.737767652888933f, 0.605331616290165f, 0.274826946403577f, 0.710517586349601f, 0.666670055891909f, 0.522059053677516f, -0.553398792071804f, -0.406610321679562f, -0.893232547853708f, 0.549587730399741f, 0.714498083720551f, 0.281833380830291f, 0.652788061587949f, 0.825163748516741f, 0.381299333971584f, -0.485549061474930f, -0.881961689917888f, 0.308937809723222f, -0.524542880617761f, 0.329114405956449f, 0.434631551667457f, -0.894732322264538f, -0.831528385961058f, 0.669760583803638f, -0.674650675537928f, -0.373119878846435f, 0.456602566684508f, 0.387804792569985f, -0.556983911869482f, 0.000826745899317194f, 0.687973801099889f, 0.0471935422816141f, 0.0768302380434509f, 0.317557055919800f, -0.823316513699125f, 0.394699119350099f, 0.609556161256400f, -0.0413041171293194f, -0.244100882405517f, -0.939678976894569f, 0.403390183804743f, -0.933567523933859f, -0.331149894636631f, -0.0265881324103010f, 0.224249195386459f, 0.888271870759308f, -0.119845268644579f, -0.357275416804345f, -0.597001288429956f, -0.486847206619720f, -0.181232488650601f, 0.115441291842326f, -0.599055795186955f, 0.213179364205327f, -0.205238322081458f, -0.373942142629613f, -0.610680997090469f, -0.495737765362772f, -0.257634306994249f, 0.583708320566486f, -0.372047136603982f, 0.953878668619925f, -0.632595987923462f, 0.452049761997455f, 0.166602807787896f, 0.773555002555059f, -0.277154387560832f, -0.557129156714301f, -0.985242402457283f, -0.441173064787937f, 0.561221765682284f, -0.352004972295446f, 0.970292440826449f, 0.855523836321424f, -0.528113079339624f, 0.685454746939680f, 0.322200261898966f, 0.953249967336372f, 0.825673980624808f, 0.177229970128320f, -0.728281956776614f, -0.479030792350269f, -0.00697019557862144f, 0.851652517094715f, 0.853865750362844f, 0.514736989335681f, -0.943509205199198f, -0.0524009027225623f, -0.0798997671509367f, -0.355414349557791f, -0.366273957594958f, -0.565729285138989f, -0.931573923976439f, 0.345119269147864f, 0.638375370217726f, 0.711524360229150f, 0.331664704859388f, -0.986788646426241f, 0.521200596781614f, 0.656290865944842f, -0.436907564088290f, 0.305075696150381f, -0.848337345127939f, 0.354044695448027f, 0.690691708552038f, 0.900352213238582f, 0.475181192463882f, 0.219103309687964f, 0.885437995493547f, 0.421455288320496f, -0.879874221804522f, 0.893371290952196f, -0.545214090169942f, 0.800731783168682f, 0.249421864783476f, 0.0766192343033301f, -0.745747520609971f, -0.613575150364454f, -0.700199720327423,
0.0694373671332735f, 0.759953164582251f, -0.0973030480378387f, -0.298615297250225f, 0.0176506580013247f, -0.269562553201540f, -0.405489169051539f, -0.00491991297033256f, -0.0327449030548885f, -0.688168836745951f, 0.703014457338754f, -0.0909491575673764f, 0.738417882180070f, 0.202377973915515f, 0.338436193625848f, -0.408790267504483f, 0.611776208408261f, -0.711043784659083f, 0.841495665411188f, -0.0445715899008592f, -0.127281559164749f, -0.778797832908623f, 0.210344625249896f, 0.287086540530447f, -0.703702357088620f, -0.151146112491418f, -0.785180444786487f, 0.427963227387140f, 0.873814130606035f, -0.344356753075357f, -0.755726746591465f, 0.846013365191461f, 0.126678120904524f, 0.166687962199295f, -0.148273386834835f, -0.770559345875477f, -0.999129219024862f, -0.223692721084046f, -0.652712854614213f, 0.468054498362978f, -0.911782175948953f, 0.555084850374905f, 0.103972972463380f, -0.414021910330282f, 0.938793897617340f, 0.515461292224815f, -0.127677414947037f, 0.510661477088580f, 0.898409443447962f, 0.528096097102698f, -0.444620870908750f, -0.275909952832928f, -0.516074838791812f, 0.110104492330694f, -0.293114842926621f, -0.596621371059734f, 0.152807456749103f, -0.592864305196648f, 0.948295231208874f, -0.575278847840010f, -0.312463646261757f, 0.664597237604897f, -0.177619554099550f, -0.932259652303036f, -0.295074750863924f, 0.731539128777660f, 0.860409131570119f, -0.0947206503071862f, 0.106073387018718f, -0.235389180430490f, -0.494787189603633f, -0.536357147973158f, -0.680862001049455f, 0.618979489665256f, 0.613893487415732f, -0.308605775713246f, 0.694789556987429f, -0.440049894326668f, 0.908690328690240f, 0.233612239829512f, -0.190662564463532f, -0.344799878911344f, -0.185877286582818f, -0.553543917790750f, -0.859543533414720f, -0.996044831818542f, 0.0388505104043095f, 0.650508591477642f, -0.425233346101631f, -0.576839967180874f, 0.378730359294024f, 0.531713629917424f, 0.506096660522796f, 0.854779196325727f, 0.725302682547051f, -0.414685510902716f, 0.654208477287561f, 0.580368151427426f, -0.000356066597174687f, -0.897393734991154f, -0.845565244312410f, 0.615044057364182f, 0.0434592638759266f, 0.342119048500289f, -0.696414680186901f, -0.713269554140146f, -0.580866925323696f, -0.290886355957456f, -0.473082507703548f, 0.517942229000179f, -0.846159512055215f, -0.715410253368047f, -0.526272663742330f, 0.114004124940380f, -0.207397773975621f, -0.920379649009572f, -0.277970833475531f, -0.636533427057722f, -0.972531734576472f, -0.687000156900366f, 0.872752357637196f, 0.617872391924648f, -0.835274231587444f, -0.383282792481497f, 0.399233665040770f, -0.191230601890140f, 0.620222785371960f, 0.106379326744619f, 0.987222511696630f, 0.219022023664391f, 0.179689082166371f, -0.961619514581522f, 0.570178582343486f, -0.811091514477978f, 0.924484469376845f, 0.744507591138529f, 0.272936430096096f, 0.0646316580619510f, 0.314005111302676f, 0.558833629327024f, -0.329744916784918f, -0.544045568909541f, 0.895769679770795f, 0.798125821580789f, 0.877473384028199f, 0.616163339432501f, 0.441057381106904f, -0.642498173762053f, 0.989059595616979f, -0.374771110304453f, 0.480877593471524f, 0.904941689893360f, 0.428742160807762f, -0.430483645585549f, 0.0830560957640680f, 0.694220841170708f, -0.602964792788891f, -0.522672782287498f, 0.717494777479591f, -0.918002255923909f, -0.454075191574169f, -0.378662039464110f, 0.221482629450150f, 0.750918040362614f, -0.636211037178780f, -0.254529141198887f, -0.944623201010144f, -0.720775773991847f, -0.674641067104323f, -0.208243950413264f, -0.959488786545901f, -0.619966503980330f, 0.599486634018692f, -0.0955439064236721f, -0.458181000169795f, 0.736914498713083f, -0.176789993854223f, 0.676652697410790f, -0.967275583857650f, 0.319377813603719f, -0.427030468653864f, 0.0670640089595258f, 0.769945699222976f, 0.767923203047440f, 0.985790354694142f, -0.207111795449682f, 0.219134401666738f, 0.548513609112215f, 0.977227384558063f, -0.198131173309759f, 0.914163808432723f, 0.178214485462450f, -0.240590252223318f, 0.356128697574950f, 0.453093488702627f, -0.0401152114159198f, 0.818060948361957f, -0.880551400213416f, 0.631519794065582f, 0.658832307703964f, -0.179752451562622f, -0.237844011105596f, 0.739834592198990f, 0.711355594921083f, 0.774856912009109f, 0.321864249971600f, 0.470574585274056f, 0.261964793641569f, -0.634481134262705f, 0.461363065389595f, 0.0879014163867016f, 0.698353456328335f, 0.0611830044908546f, 0.918599000791453f, -0.147822590771951f, -0.208296009525534f, 0.775436805889909f, 0.0380914463017457f, -0.954468558268744f, -0.620451283908529f, -0.770251739379244f, 0.772246778681563f, 0.326462458587915f, 0.417738473564738f, 0.0942643452092895f, 0.486153909005530f, -0.720202618855819f, 0.0172425211828453f, -0.460430186764708f, -0.582933725313246f, -0.439721219285309f, -0.694337374508112f, 0.493516461453915f, -0.993527345413430f, -0.562763570629586f, -0.0644937992008268f, 0.741476357523546f, -0.668588797988340f, 0.594184164979780f, -0.605220767543645f, 0.110074204567278f, -0.599398769115359f, 0.723882026196765f, 0.678747828159456f, -0.608589528492249f, -0.881419419882399f, -0.139357674240927f, 0.873828011683502f, 0.314798068434754f, -0.457017849147976f, -0.526003289738433f, -0.411404919696823f, -0.792254466556923f, -0.299635866135236f, 0.0102316480137963f, 0.161921266554201f, 0.981427028530907f, -0.647351555346480f, -0.183312260273700f, -0.348651484808239f, -0.198142718294920f, 0.589869434168343f, -0.201926511662287f, 0.0337896878721506f, -0.0276515055864679f, 0.236943449722327f, -0.473103622922213f, 0.954358213176107f, -0.536519478008862f, -0.603363977756898f, 0.776267386457251f, 0.780662223932714f, 0.289187291033147f, -0.439954328280331f, 0.0429585232791456f, 0.457321950803212f, 0.236810565417317f, 0.167393310927116f, 0.634521586990289f, 0.154409349572581f, -0.750588956901316f, 0.862647670558265f, 0.800182258889404f, -0.342011510602950f, -0.102697321575297f, -0.797254530582515f, -0.718599505627591f, -0.729105921762328f, -0.152424255231618f, -0.702781451563249f, -0.0212710413372206f, 0.961258625954530f, -0.598484979483616f, 0.188043416567111f, -0.511990501189325f, -0.437449883017104f, -0.352443017251219f, 0.0991554004559394f, -0.663282401319921f, -0.835139403797870f, 0.587602722898819f, -0.939771062270554f, 0.613878515061637f, -0.523857415147229f, 0.444842501987166f, -0.297001528475358f, -0.914581150341453f, 0.554844832376064f, -0.816400014706997f, 0.823726509832068f, 0.704425080572720f, -0.819397910034912f, 0.999003444973468f, -0.968751535943602f, 0.0311500939174130f, 0.247867291448898f, 0.835560943875924f, 0.169794916341582f, -0.302041142019408f, 0.289549413666482f, 0.672141268085176f, 0.947060095876251f, 0.324754171403184f, 0.800014020753458f, -0.785428883146460f, -0.463092135879982f, 0.659192831110219f, 0.118301326248760f, -0.542297334341874f, -0.335957421787428f, 0.794808066256455f, 0.625133567458879f, 0.227917183877260f, 0.533557157748932f, -0.948877884679630f, 0.186417887458649f, 0.859592912781013f, -0.0183320237921572f, 0.967066787435574f, -0.141349529637213f, 0.958107445094614f, 0.264359167622140f, -0.631325355674829f, 0.684598042547604f, -0.527467468151933f, 0.294659298854560f, -0.439220168509424f, 0.391038218778621f, 0.0155669207052447f, -0.681384294454809f, 0.146739459198561f, -0.756404876084652f, 0.381192113543008f, 0.442850940158445f, 0.964002016096921f, -0.0507253848694798f, 0.563462880019551f, 0.190980650425415f, 0.482598778123453f, -0.273426091300166f, 0.980640722167518f, 0.198298590133615f, 0.678100193958147f, 0.530416610025615f, 0.196483886579908f, -0.00515783872303177f, 0.0273438459465027f, -0.257248394117661f, -0.576964504105195f, -0.331030677719652f, 0.389178134459083f, 0.0714066784585938f, 0.915179137858455f, 0.529738860096996f, -0.0851681338619263f, -0.692212896293625f, 0.0786352959300358f, -0.122712774017974f, -0.154641019547052f, -0.487537192251297f, 0.0435645872670241f, 0.856938631597551f, 0.351874085305670f, 0.708100804109985f, -0.701200509799317f, 0.0804479422214388f, -0.0794375302823220f, 0.543751723132725f, 0.346144383452864f, -0.680373368944156f, -0.572281173045994f, 0.237981706511708f, 0.0671482960376590f, 0.852393956008547f, -0.301262907769845f, 0.523762878044853f, 0.0885512158718469f, 0.885168455552951f, -0.333351382431635f, -0.914187358461713f, 0.657220242471575f, 0.202238670865175f, -0.660684692864216f, 0.641271628674064f, 0.795923699912913f, -0.332641448887164f, -0.297595219329770f, 0.427283618553541f, 0.601893958036382f, 0.355248259075043f, -0.420766820174961f, 0.355159952778514f, -0.806733697216087f, -0.694403711049608f, -0.719250654428532f, 0.580487742419744f, 0.959156165420351f, -0.941898541689400f, 0.960568821753178f, 0.119007749103819f, -0.973468502734443f, -0.627534816021182f, 0.331394418445345f, -0.415230278112412f, 0.225355270950915f, -0.216818510922154f, 0.716553646689289f, 0.149097723527982f, -0.212491921692561f, 0.681645638056938f, 0.675358683729395f, 0.0591550775861416f, -0.221626142364110f, -0.235878877821190f, 0.168188057112471f, -0.709738432254387f, 0.842890391064944f, -0.331175752377862f, 0.231375360302226f, -0.714989093452242f, -0.492645353426504f, 0.552424848261518f, -0.436987392663331f, -0.336155191719795f, 0.137666231065822f, 0.739347397348610f, 0.493222787180627f, 0.283646543313800f, -0.603522923409923f, -0.474181275984451f, 0.249315354427624f, 0.323736714335287f, 0.933612934150728f, -0.651555022796413f, -0.743229221575077f, -0.648309364385349f, 0.115117716036212f, -0.0689988553878600f, 0.0394979772968704f, 0.732729774997258f, 0.487584669162102f, 0.808754952095239f, 0.827617962775983f, 0.550826738558347f, 0.890858298785235f, 0.152998196795770f, 0.401198245071198f, 0.187173931669199f, 0.576387011979054f, -0.464903903379260f, 0.735172244343599f, -0.0393734341215035f, -0.501927105416023f, -0.852926247859480f, 0.384774001880198f, 0.723957370923565f, 0.869614310250896f, 0.698124990202440f, -0.0618370378422302f, -0.273879540781302f, -0.0745005910544518f, -0.754408143155094f, -0.859084370639359f, -0.709011936778905f, -0.883595552533659f, 0.326386065122049f, 0.756686513420982f, -0.639817612043620f, -0.536531544653662f, -0.596858657734988f, -0.187117983404806f, 0.760208405412209f, 0.191383034225783f, -0.771443976174702f, -0.371171018178012f, 0.723338724416329f, -0.325113980261468f, -0.652823731845602f, -0.902765567501679f, -0.109945188610355,
0.863727536109734f, 0.762531987550249f, 0.484671237555863f, -0.376731181566557f, -0.961176245257487f, 0.374503763045540f, -0.275274129954644f, 0.947951135663002f, 0.891610575724484f, 0.233179187366345f, 0.868694446846928f, -0.201812205484274f, -0.676342903796604f, 0.962133604967067f, 0.0941637112283598f, -0.0856261317646829f, 0.375061189807232f, -0.275342940020193f, 0.0614298144531287f, -0.183234253182376f, 0.146964792162229f, -0.307180215012337f, -0.139123531176191f, 0.130840221889238f, -0.0654726742084248f, 0.988722897887987f, -0.805684911622576f, 0.763299463922693f, 0.148136188784880f, -0.432183160161832f, -0.592185939638987f, -0.593835208842770f, -0.366135084813261f, 0.840566739882685f, 0.572052978307971f, -0.825682529425410f, -0.970222226210689f, -0.554421263584439f, 0.324648156825255f, 0.0472246837302466f, 0.168098848238140f, 0.00634984653176796f, 0.850237261066903f, 0.286624344510407f, 0.196043215794080f, 0.289161416244007f, 0.334801090322515f, 0.871286740072183f, -0.754609531300255f, 0.623871003889383f, 0.0843430009639772f, -0.736369938040848f, 0.400507674511444f, 0.816325383600297f, -0.500667496861800f, 0.453092855162135f, 0.281798170796444f, 0.631969623501011f, 0.472467114651372f, 0.525988741184527f, -0.124862967293674f, -0.882904489381606f, -0.501090007558747f, 0.631622297793485f, -0.0234210285578584f, -0.521093811962915f, -0.0402368492672573f, -0.762999364505356f, 0.948716268452360f, -0.572740830308272f, -0.261042904339051f, -0.506108365537530f, 0.585933508412429f, -0.362463094458446f, -0.885375028242576f, -0.835757117571791f, 0.337250829139564f, 0.298618238243588f, -0.744903291826588f, -0.979848674056393f, -0.488518944548476f, -0.000297116577397283f, -0.137863396173336f, -0.627207234158244f, -0.970417810284170f, -0.601487862773028f, -0.999527775716382f, 0.116672274325216f, -0.786330829714504f, 0.740118245374718f, 0.856485463622646f, -0.555144930193560f, -0.0168912375666686f, -0.774544329159697f, -0.782767315598991f, -0.600844843420598f, 0.885816107471180f, 0.577075799078571f, 0.663829997048111f, -0.359000184287277f, -0.390009578642891f, 0.202240602818017f, -0.0191477232064394f, -0.566459499064884f, 0.288883557382261f, 0.962583478738218f, 0.782123756762393f, -0.312311582870785f, -0.749354208187204f, 0.205679267602357f, 0.804004517387718f, -0.733078779233144f, -0.426195645938973f, 0.686872484317089f, -0.398704803137823f, -0.267786412313359f, -0.374306263341615f, 0.632992513422251f, -0.972217744254910f, -0.167080739523409f, 0.608176739669718f, -0.935550125875275f, -0.422451600932096f, 0.499643952974426f, -0.491034978653149f, -0.0256130378373849f, -0.158669355267388f, 0.360503946885584f, 0.227714934784132f, -0.138648043280479f, -0.0707461296301128f, 0.0638330442765616f, -0.168811643868974f, -0.575670642767690f, -0.162143785491822f, 0.528621079903453f, 0.581283330394272f, 0.444430744183000f, 0.859288341846780f, -0.170487584890459f, -0.440175706710406f, -0.184806402672108f, 0.676010805169568f, -0.0117535553470483f, -0.231606756742133f, -0.210042044569361f, -0.517950708003565f, -0.805772781723687f, 0.156938933772370f, 0.892075905739393f, 0.403874478002384f, 0.572031508558373f, -0.604145909072008f, -0.330076696654475f, 0.0314560087228033f, 0.683787496948704f, -0.788582181996934f, 0.835276281386949f, -0.0644658492206380f, 0.938270191882745f, -0.344927907293928f, -0.976720519493346f, 0.906264084343827f, -0.648152742145255f, -0.776984965421811f, -0.299470572593974f, -0.423690646950321f, 0.749911693814570f, -0.701929894551648f, -0.665191316321370f, -0.568359320650352f, -0.957309362369509f, 0.914088966355983f, 0.770952996203681f, 0.0924190787439159f, 0.844599990803978f, -0.613336716591875f, -0.683270165308367f, 0.358563204319583f, 0.934597169812267f, 0.236596595813630f, -0.895964332479994f, -0.673302324943916f, 0.454883302340070f, -0.473926010524343f, -0.576000657136217f, -0.644850950007290f, -0.980218836434995f, 0.321620362364719f, -0.799924718666919f, 0.0619872524925393f, -0.609255645268410f, 0.159243124858648f, -0.339764623434603f, 0.379865023026277f, -0.923132229333074f, -0.0300494021321296f, -0.183835365297645f, 0.122648511393234f, 0.887652015676064f, -0.616448517838488f, -0.920600866006207f, 0.352861591267815f, -0.930578364778234f, -0.378819076263050f, 0.775423778544869f, 0.836977798656885f, 0.0472244767469148f, 0.484934339557912f, -0.939155187409193f, 0.261555270800537f, 0.143595058480400f, -0.323517719771947f, 0.483466454684928f, -0.423163689969697f, 0.356966814701025f, -0.843907304366205f, 0.945903563730962f, -0.495952298317153f, 0.972277051575873f, 0.153052037173145f, -0.715894882755676f, -0.617028915483254f, -0.332307224095366f, -0.171207102890728f, 0.841771328272651f, -0.0308707743261867f, -0.626480028747696f, -0.729235538916864f, -0.743517330301179f, -0.733868915239511f, -0.449192858200231f, 0.362286468575150f, 0.327436676142902f, 0.609768663831898f, -0.147499187968100f, -0.470195300907973f, -0.232167856443943f, 0.225074905574485f, -0.0818541072414634f, 0.793403933843056f, 0.267628199755028f, -0.391701371806294f, -0.846991992740029f, -0.776221590294324f, 0.121351482320532f, -0.189789365942677f, -0.894392208695015f, -0.632864319945356f, 0.927817761109627f, -0.732454610273421f, 0.260011686544283f, -0.713973491605344f, 0.469764032416604f, -0.608895265807545f, -0.684992974060601f, -0.745556289276139f, -0.536308213076133f, 0.586581187207818f, 0.149804345860779f, 0.401576742698496f, -0.719670291046630f, 0.618659855530024f, -0.256639783379370f, -0.862966031725668f, 0.893866512913152f, 0.861800793529066f, -0.704895723095590f, 0.154163397540805f, -0.0775797186536984f, -0.252297335448882f, 0.869851864160888f, 0.428747373815147f, -0.818372805928921f, -0.739117647833389f, -0.697378012429133f, 0.182997863108567f, 0.689563104159966f, -0.0506114067037338f, -0.705077813920782f, 0.452892458862023f, -0.365069844049503f, -0.889224821648518f, 0.0194889225677406f, 0.847743515500726f, -0.0650338075825718f, -0.108889937983496f, -0.168485037502421f, 0.912533003086865f, 0.428132366084106f, 0.692652998111620f, 0.130599999674344f, 0.411245435867244f, -0.194909473459497f, 0.562152151569866f, 0.503795293326445f, 0.801805532943245f, 0.795718119772331f, -0.327975015537058f, 0.771389506217327f, 0.237139782375987f, -0.793798852884360f, 0.537824655594807f, -0.0767253125021830f, 0.444538451472890f, 0.623473048970629f, -0.500663871860675f, -0.890399840538612f, 0.389528755348857f, -0.915832255765501f, 0.000652855725217894f, -0.121310443088642f, 0.206662014558968f, -0.409513641801496f, -0.0496262665388731f, -0.313314447256644f, -0.994839397423865f, 0.344513198428247f, 0.250828855150578f, 0.845438302422055f, -0.728803841305459f, 0.249670562418639f, 0.543601559270672f, 0.0138774767713057f, -0.0667600054234216f, -0.803421294778238f, -0.222729734665659f, 0.461896933387103f, -0.378537171475208f, -0.464200027877777f, -0.363170335357481f, 0.616070694104851f, -0.316407896795124f, 0.131719997218670f, 0.0622146037260092f, -0.881713850066484f, 0.400811652868418f, 0.163777537634682f, -0.528768052383715f, 0.553072310703894f, 0.931393033749660f, 0.410062835546529f, -0.190904471223264f, 0.0533617852685424f, -0.911780226731855f, 0.823696403963215f, 0.756735978125573f, -0.849701310148249f, 0.106070214350541f, 0.747890454578944f, -0.559823302095172f, 0.976181619002882f, 0.506524051225122f, -0.0735228576098872f, 0.635610640336510f, 0.607728217052133f, -0.383443012662118f, -0.640835123345673f, 0.0897243696426577f, 0.722421963278953f, -0.368833835044170f, 0.684790387373836f, -0.0336846755494535f, 0.199819176553169f, 0.351822803019512f, -0.433387005248570f, 0.709401898386598f, -0.0149217994364210f, -0.549115733466769f, -0.774049259429836f, 0.440376751789406f, 0.740171176715015f, -0.322301969056869f, -0.148261856544327f, 0.724527166150266f, -0.744178178219827f, -0.743031462890542f, -0.00997727490160383f, 0.550074849063942f, 0.147825200269716f, 0.777182602759074f, -0.625412073440604f, -0.0614214671235789f, -0.400121310797195f, 0.864511820640236f, 0.327656445569618f, 0.765838911283705f, -0.906185069285438f, 0.543656228031101f, -0.527337383463707f, 0.544932532036177f, 0.453966596910417f, -0.422906847383216f, 0.803455668330395f, 0.496651297123425f, -0.254890927444284f, -0.940902660088963f, -0.0691448074129200f, 0.0165534278793877f, 0.510199004798987f, -0.0286331020627788f, -0.141471298460923f, 0.872000980716430f, -0.752995088893842f, 0.167696515625982f, -0.181673581299286f, 0.496236252387172f, 0.854022562040503f, 0.388320660177419f, 0.499320363074588f, 0.173522726183149f, 0.0334192536945390f, 0.631347719906229f, -0.832803059709609f, -0.523826088751894f, 0.322557683663180f, 0.0263621365506006f, 0.948982322858062f, -0.253991680115490f, -0.165970359640120f, 0.331700483099733f, 0.808731855823033f, 0.159862831431822f, -0.438178259673022f, -0.943749594272300f, -0.967819867274861f, 0.263403865531262f, 0.710981741513574f, -0.274597382335371f, 0.929606564147885f, 0.125943272920181f, 0.691306164809532f, -0.607946869004681f, 0.284352421048012f, -0.421663515398071f, -0.409479725854699f, -0.152265311389352f, 0.630868673855242f, 0.123144840061153f, -0.645105689918733f, 0.360153393247973f, 0.683885744053582f, 0.752598814717991f, -0.581494857182821f, -0.469116962448560f, -0.0691726199196117f, 0.174679188611332f, 0.351269328558955f, 0.394815335607621f, 0.710281940645013f, -0.618593505217632f, -0.721546422551907f, -0.974088703589852f, 0.939556772536401f, 0.599407011070674f, -0.342213391542906f, -0.387135346574836f, -0.572027944718123f, -0.622717582512866f, -0.676949872287677f, 0.993953153886700f, -0.784539234625462f, 0.788778188174951f, -0.0652679971583152f, -0.988740647590182f, 0.748989697777310f, 0.412949190397683f, 0.206661198525718f, 0.573116044772809f, 0.938498079842984f, 0.743167714677278f, 0.755679122637903f, -0.295095987460132f, 0.217166189740252f, 0.230160404687938f, -0.504654557405015f, 0.472402206737240f, -0.867751757044285f, 0.869050101160567f, -0.905285205825199f, -0.0698843699947245f, 0.762379282963140f, 0.634191197174691f, -0.498487028811837f, -0.284257632541078f, 0.224245853978976f, 0.412950901773606f, -0.831984679101472f, -0.375663639002356f, 0.153699995838016f, -0.953997055484851f, -0.545360745186449f, 0.637687001020610f, 0.465459355638311f, 0.0769011654935299f, 0.267123343048604f, 0.545842501706277f, 0.778890986545214f, -0.363432183057524f, 0.479786652022207,
-0.600912698239979f, -0.738845504293020f, -0.775987143750184f, -0.705559714187038f, -0.310523750352236f, -0.576081829930414f, -0.0341897834633795f, -0.388414434291246f, -0.790681299048144f, -0.169440674711419f, 0.219815472280053f, -0.323451599202462f, 0.835623141427806f, -0.932446301638351f, -0.831480966559550f, -0.185050128422203f, 0.946045240208487f, 0.864740749402213f, 0.916918979039328f, -0.204049261822351f, -0.807183358636872f, -0.484543897885746f, 0.974235382435000f, -0.208019257024664f, 0.647411336652954f, 0.0961385231960816f, -0.800258527388060f, 0.352982142334643f, 0.917274278881503f, -0.733934252997685f, -0.229420044045673f, -0.358499183112933f, 0.469156578609832f, -0.859359096702447f, -0.937762141277625f, 0.389776419837803f, 0.458425599271073f, 0.542973137971009f, 0.675023236195573f, 0.944029213696263f, -0.774027667733194f, 0.262984845114612f, 0.842689106929982f, 0.349251854560315f, 0.815938991679117f, -0.226283690374971f, 0.144356327986477f, -0.610588223452142f, 0.539695204296007f, 0.655759463021729f, -0.725805170479948f, -0.194977831685847f, -0.306105075607822f, 0.725461617920836f, 0.678283785172857f, 0.250577882812283f, -0.571672652704059f, 0.112132856850530f, -0.236412229648694f, 0.768173015701816f, -0.799251028098975f, 0.100723381526471f, 0.113856811781171f, -0.0281630563735495f, -0.0727902548617043f, -0.515248547261805f, 0.795765010992038f, 0.505540143557856f, -0.496124371632015f, -0.363010091302494f, -0.302067159683438f, 0.941309812688142f, 0.0564765277142674f, 0.733027295879568f, 0.582734217224559f, -0.159007222603058f, 0.827637470837748f, -0.163060519537145f, 0.352357500273427f, 0.920405360379926f, -0.280691553157313f, -0.401974149240862f, -0.131353114797667f, 0.0719728276882135f, 0.795795661384902f, -0.348203323368113f, 0.946184663961743f, -0.188400643814906f, 0.979319203447783f, -0.132195434304746f, 0.585832597473452f, -0.894730397941282f, -0.998045985412111f, -0.717844040997160f, -0.706372640246558f, 0.237517748136224f, 0.767232946579208f, -0.246080656591091f, -0.767887803661775f, 0.139501344992184f, -0.545658806327887f, 0.480755550666584f, -0.355750609145607f, -0.493518864013929f, 0.832011102158605f, 0.122542855024589f, 0.179356501845966f, 0.630805165349165f, -0.888557403477561f, 0.861375782261841f, 0.963467658712489f, -0.00498707715217361f, 0.341894517453263f, 0.654808049991043f, -0.826909952854692f, 0.101446328788119f, 0.401514152845232f, -0.830556985096328f, 0.832187560444347f, -0.657254039822149f, 0.0304197382717133f, -0.718462386339415f, -0.592343549551534f, -0.356333235896531f, 0.674135547073730f, 0.606490641440102f, -0.707328770155748f, 0.0251846271186025f, 0.763024927861424f, -0.258224600040528f, 0.456384203436896f, 0.626482995304888f, 0.162353458245830f, 0.964280614412026f, 0.869262296229816f, -0.0659501568862260f, -0.712869755397848f, -0.946968242335746f, -0.852822740386429f, 0.791522782900379f, 0.824530390150335f, -0.369383609091590f, 0.118366422602132f, -0.713278848975255f, 0.549165545117801f, -0.00201102645336770f, 0.748955154405439f, -0.173689412898754f, 0.175162399203493f, 0.0819730422177463f, -0.804833155982895f, 0.972966530563786f, -0.0614871820303859f, -0.293463394754661f, 0.885919261783643f, 0.498531250561504f, -0.808874001349436f, 0.364344357769432f, -0.945616638616975f, -0.285864129675031f, -0.0438177789332626f, 0.303981486324719f, 0.362653007142366f, -0.543157427730716f, 0.174551703296805f, 0.140105048664068f, -0.704163993684247f, -0.647461975308389f, 0.831243960763754f, -0.364954329841192f, -0.730289885595360f, 0.0119708019435723f, 0.796338505809816f, -0.227851954967331f, -0.927330125804492f, 0.0602265250934577f, -0.485204061877453f, 0.198319346525046f, -0.529723177394882f, -0.321493822700232f, -0.839566193416413f, -0.187812484529161f, -0.396142329367383f, 0.367600156667632f, -0.922657847865138f, 0.893508892950972f, -0.504434314314017f, 0.663184814192863f, 0.887813887366393f, 0.267103483259066f, 0.984313142773772f, -0.667515321448428f, 0.0718416862496054f, -0.733363156570869f, 0.00186343206374962f, -0.316531364321301f, -0.467549697367438f, 0.569865535259013f, -0.556502178434536f, -0.650896672234238f, 0.564462797319346f, 0.585276582729153f, -0.433005641153548f, 0.847012427243871f, -0.462088105064984f, -0.379468633087939f, -0.0104892833799723f, 0.654191676584918f, -0.893278846859767f, -0.689350274835588f, -0.333220721049179f, -0.0461703436190983f, -0.463411501818667f, -0.995085073808794f, 0.526075522777196f, -0.0686703698159610f, -0.855908120278260f, -0.239774384006192f, -0.524142243888286f, 0.119526621106050f, -0.838266471869898f, -0.459366707886497f, -0.974921205300089f, -0.680517660007036f, 0.507695286553230f, 0.0920009889477380f, -0.674459855090400f, 0.554585280302756f, 0.357871391273056f, 0.453052004120624f, -0.991707675828263f, 0.144725488641274f, 0.0886535789688503f, 0.708257184179799f, 0.579351194763774f, 0.902098539548710f, 0.0104715251706708f, 0.112677648152527f, 0.0513772996762050f, -0.647561525299580f, 0.321958856072156f, -0.433510239079594f, -0.481493822802105f, 0.651663699618654f, 0.922649363108760f, -0.751799312011289f, -0.0336105332513619f, 0.236872038257485f, -0.0434863841224971f, 0.150810692021768f, -0.217629544451037f, 0.345890414626050f, -0.471941673338326f, 0.675001035054686f, -0.986585320322202f, -0.784679789758475f, 0.270727429189404f, 0.595792127677512f, -0.485969146811564f, 0.222507692419212f, -0.850070310429306f, -0.575184466843042f, -0.220860571657717f, -0.749449040845746f, 0.743039624335149f, 0.463892797640518f, 0.224829531690830f, 0.935410439714992f, 0.00609595972560872f, 0.830877831388658f, 0.0270299847557276f, -0.648763861115704f, 0.471982277585509f, -0.145722971031426f, 0.650947186397952f, -0.266164907037466f, -0.962378355156458f, 0.354855353373398f, -0.184127215272909f, -0.825621979621661f, 0.595495186093792f, 0.448679578752395f, -0.839671989567806f, 0.302158874138200f, -0.735484620769119f, -0.891040803749876f, 0.880298595525880f, -0.281199581528421f, 0.0195033020490396f, -0.511515485794419f, 0.447303195702203f, 0.375317547074287f, 0.964442757731427f, 0.167643569291013f, 0.0118587246816413f, 0.958187068873858f, 0.315395458761821f, 0.188852872643367f, 0.417450657662866f, -0.540566147670448f, -0.422709015019828f, 0.101425586029329f, -0.235465301656357f, -0.806044548641562f, -0.617153815671298f, 0.350658348898447f, -0.738540593521098f, 0.291893065415692f, 0.335435501842245f, 0.832048727909480f, -0.609539777284250f, -0.436992256701542f, -0.685315947977391f, -0.502107715051164f, -0.893460699283628f, -0.262263680492396f, 0.454417031133778f, 0.223227655510993f, 0.605288383003966f, -0.698800586984034f, 0.864843125666124f, 0.363752223710394f, -0.354571459375900f, -0.575008718239530f, 0.423061550052490f, -0.272459660313524f, -0.116932919064239f, 0.547073367599225f, -0.890822451422250f, -0.884262586749836f, -0.889803003239001f, 0.217660629852574f, 0.154863581361214f, -0.333284425759330f, -0.826087281020982f, -0.958198419703014f, 0.850114828540176f, -0.391190814837661f, 0.956578087128909f, 0.0541599967910713f, 0.0988550815990206f, 0.851903747125444f, 0.361959550717838f, -0.901818125706440f, -0.0561477675277424f, 0.522090821863134f, 0.263383912024089f, -0.161061362097086f, -0.983707460720128f, -0.333128836619106f, -0.546535222349413f, 0.627261888412583f, 0.408731616102241f, 0.754700916401496f, 0.869772826180715f, 0.362242883540519f, 0.853587698951791f, -0.698910717068557f, -0.671945256263701f, 0.802655941071284f, 0.338701009518668f, -0.0297818698247327f, -0.881311052338108f, -0.296717226328950f, -0.965699941652671f, -0.737164428831818f, 0.00804554422537485f, 0.989716933531351f, -0.832438692682457f, 0.454553001515962f, -0.933801685729775f, -0.644562445615081f, 0.104508389084640f, -0.535426180524709f, -0.937041822784313f, 0.599911275476691f, -0.789109397888652f, 0.821293320968620f, 0.818032308067912f, -0.838306491947354f, -0.172883985566904f, -0.185775969502745f, -0.672256019841514f, -0.412525056012874f, 0.142272136963196f, 0.792136721788200f, -0.726314486042219f, -0.445981475954073f, -0.857821372905156f, -0.783006950965519f, 0.438776336055643f, 0.400193156140386f, 0.177525578340235f, -0.435380642286229f, 0.547815754835977f, 0.0496394855194708f, -0.442174406426496f, -0.0856142956982360f, -0.0247840885457120f, -0.779016166389253f, -0.511802368745331f, 0.319887353303028f, 0.721806644023428f, 0.770423389111803f, 0.809969588377187f, -0.196191981856391f, -0.105718971622809f, -0.301674515042257f, 0.613622254387482f, -0.969517273103490f, 0.0144576310630131f, -0.668829420461301f, 0.750377960820232f, 0.696858494013122f, -0.563485511352760f, 0.726226115587466f, -0.227540741583116f, 0.665488592033944f, -0.124611809537824f, 0.489550286613580f, -0.579185308695604f, 0.628687311174276f, -0.295770837727116f, 0.240358361854250f, -0.155642183802961f, -0.885945841456110f, 0.388592282428421f, -0.663862196774143f, 0.363779469451472f, -0.371285870971327f, 0.563159689631810f, 0.102725415308920f, -0.320909176496511f, 0.334328794247963f, -0.401664407219370f, 0.726728495517480f, -0.192310060924823f, -0.107973316004269f, 0.898177814643418f, 0.456682306673978f, 0.890742303266606f, -0.742770990765425f, 0.0337493848747046f, 0.786190819119190f, 0.911503487800545f, 0.288384155888888f, -0.249479393879906f, -0.431949793185094f, -0.0847659302921913f, -0.475416985100444f, -0.362720571751962f, 0.676910741300893f, 0.00488530543559529f, -0.227678010632002f, -0.0632947771540859f, -0.990261099329279f, -0.708485805011827f, -0.304846597458441f, -0.480289782580152f, -0.593254971635338f, -0.656335976085053f, 0.584373334310954f, -0.493268395245234f, -0.00212668034894836f, -0.480221591678953f, 0.622365041709782f, -0.258845071515928f, 0.943825418665593f, -0.716642329101759f, -0.765317239111819f, 0.324487844009035f, 0.108158868464706f, -0.790583201992229f, -0.649218622127061f, 0.751409704126257f, 0.301455204388007f, 0.620482350165047f, 0.411016780608874f, -0.878843779367281f, -0.779673415191805f, 0.616508572699874f, 0.0750844738292273f, 0.341011338533919f, -0.553376665552953f, 0.277561087965059f, 0.527499935800293f, -0.489644680144407f, 0.514353996113782f, 0.229842524701725f, 0.139172928186734f, 0.793753206591897f, 0.835555341130211f, 0.794120687009671f, -0.0994745468343306f, 0.109098970584400f, 0.383123470993648f, 0.272549010931094f, 0.683070582699418f, 0.522823199313615f, 0.235903759158310,
-0.269490013000195f, -0.103775744391749f, -0.994083979953753f, 0.754983594207459f, 0.806308398378106f, -0.997543362839150f, -0.00396367603607373f, -0.873768378178592f, -0.755907732827809f, 0.703713206520365f, -0.0716773056166142f, 0.0792968663717508f, -0.113760825029016f, 0.828188140127672f, -0.103062543982628f, 0.0455017026983378f, 0.330658414568756f, -0.615810862221588f, 0.827890015477212f, -0.507551960954374f, -0.371044788092612f, 0.723489294741891f, 0.169072478802524f, 0.885612989356318f, -0.496475905980558f, 0.114400438991609f, 0.427961880327008f, -0.0456714004002505f, 0.0246660859589438f, 0.175616122301987f, -0.349777838484285f, -0.939474935533562f, -0.215061649130134f, 0.907049169335834f, -0.0553600192559760f, -0.982464152311714f, 0.405919915647442f, 0.755952405091542f, -0.695422520039876f, 0.373280568864688f, 0.483909023765611f, 0.784896384994620f, 0.978722132488262f, -0.113866140463085f, -0.630016943176703f, 0.512742627309861f, -0.829104067044703f, -0.240982431155520f, 0.0107361024967163f, -0.438682584788413f, 0.935730031472303f, -0.953447901200043f, -0.984218956474073f, -0.745077052885218f, -0.466232938128846f, 0.0326267564209573f, 0.303877586274065f, -0.199843777507458f, 0.674317529952029f, 0.448678903834397f, -0.681863209154081f, 0.273397524216090f, 0.193101955704959f, -0.342858479278718f, -0.485179713360910f, -0.586067050491890f, 0.393099777352274f, -0.982324485510343f, -0.852553426343700f, 0.773613825101220f, -0.590256032959421f, 0.837952413540589f, -0.643137731235821f, -0.311955662956384f, -0.888588599835619f, 0.304629859477166f, -0.810098957400030f, -0.534291626181040f, 0.878601703692302f, 0.362706441157764f, -0.254447668911795f, 0.604309282304246f, -0.977266419340276f, 0.250927873824064f, 0.549600558999971f, -0.796155833245480f, 0.226373301058549f, 0.0137578302483823f, 0.819708534464965f, 0.185662636424304f, -0.450456459548662f, 0.0953849597308440f, 0.736872088617975f, -0.582024306116842f, -0.0522261513001507f, 0.394348349710790f, -0.461023913227183f, 0.139996201153565f, -0.790168851966909f, 0.692544084408690f, -0.580603732841955f, -0.584540773580447f, -0.967062276813525f, -0.00886260208554912f, -0.0520831218167985f, -0.999614949922684f, -0.965820736077636f, 0.366390034326646f, 0.0323069925013668f, 0.164651515113853f, 0.300260003499445f, -0.340634856317630f, -0.238157231550037f, -0.291645957143165f, -0.773881882387456f, -0.144494053860223f, 0.660329619628580f, -0.626727996257997f, -0.994965090982706f, 0.161018019917379f, -0.327211572176153f, 0.0410991278573425f, 0.0123663905917732f, 0.747176159655312f, -0.485981637435718f, 0.00667961234248971f, 0.631625759154389f, -0.831294487064668f, 0.449606477050286f, 0.768845094514142f, 0.928354534843426f, 0.812647997969340f, 0.353418126917875f, -0.872184763557736f, -0.579130598386915f, -0.912928075675835f, -0.779484407508668f, 0.534916834944041f, 0.326353225230543f, 0.395431557674662f, -0.842103899863317f, 0.196590107332985f, -0.261317824893025f, 0.750190543523333f, -0.103409967857074f, -0.201452426430379f, -0.213633615009587f, 0.578822104214576f, -0.130809161238349f, -0.774608769872343f, -0.0222201705228122f, 0.126990738965544f, 0.785780586747108f, 0.0379484317527632f, 0.837140835706189f, -0.191007948387153f, 0.106781679021568f, 0.990298140861558f, 0.618337701073777f, 0.460255491901774f, 0.716379796730692f, -0.159421014009881f, -0.560212468621569f, -0.147263014783522f, -0.962301694075771f, -0.327702010262213f, -0.773959532468388f, 0.351239668535113f, -0.682281479449518f, 0.342188824054257f, -0.743039216419066f, 0.700710268270439f, 0.919651386092770f, 0.626343233048871f, -0.157189576636596f, 0.781882574006976f, 0.349953565654219f, 0.361235312853466f, 0.313242228422046f, 0.582185182102266f, 0.554504358491139f, 0.711217954194576f, 0.332473377627418f, 0.165078226255772f, -0.228349029389292f, 0.899730713958153f, 0.653894503448836f, -0.0452904440925501f, 0.0328806142413372f, 0.793701315832839f, -0.703826261467540f, -0.901648894320192f, -0.195631966969018f, -0.0470590812056508f, 0.487185699934959f, 0.175961644103331f, 0.818028721319245f, -0.224389104974946f, 0.901974203693823f, -0.153212477843726f, -0.472747796173897f, -0.587471692952684f, 0.452340198339707f, 0.996443894349412f, -0.849126217374502f, -0.403800337277983f, 0.923427876645159f, -0.0516037992113898f, -0.380335341989182f, -0.299914673109747f, 0.764492139190834f, 0.773463290027243f, 0.0175454601261817f, -0.400742340353541f, 0.912354892189422f, 0.999766609328281f, -0.521321752061712f, -0.365769506846305f, 0.477612405338644f, -0.0522578739905535f, -0.479259238587280f, 0.645161410912429f, -0.702546085166056f, 0.359736398041538f, 0.638130894056863f, 0.115633419893101f, -0.674410360620500f, -0.150824943737990f, -0.824854463897591f, -0.504410162129685f, 0.560317574021813f, -0.159611666752889f, 0.997647540626334f, 0.702777895178414f, -0.946494281691535f, -0.0109619562916898f, -0.383756482005404f, 0.872670066971334f, -0.453527506439184f, -0.635719199113957f, 0.932852122005178f, -0.800755479140234f, -0.225213334363716f, 0.251163542389519f, -0.598147625383133f, -0.155241293946661f, 0.967736510890644f, -0.0157250628103103f, 0.250570924071858f, 0.209749651169078f, -0.381016062687537f, -0.679300447230592f, 0.160197663113971f, -0.749803147200800f, 0.596917045783617f, -0.0878737681749431f, 0.642402180339789f, 0.261614973684270f, -0.111833224093973f, 0.300170844971678f, 0.317966800167647f, 0.0585375534708252f, -0.842709435910728f, 0.760207701069839f, -0.979366191145221f, 0.940703569377911f, 0.866488078693979f, 0.553497107695259f, 0.127260247084497f, 0.530106152060111f, 0.725171359852920f, 0.356742729430045f, -0.209841680046178f, -0.164239817187855f, -0.888858150931758f, 0.0367561852378047f, 0.803496113779956f, -0.594927045375575f, -0.00347281985657166f, 0.114118941713783f, -0.427864462568672f, 0.719021423892768f, 0.335845790828654f, 0.0207216235296064f, -0.523146933862102f, -0.145001077781793f, 0.490566784879983f, 0.461904660734682f, -0.897010089735077f, -0.895737903861849f, 0.343397505472310f, -0.684377591381862f, -0.0154016881290400f, -0.462987614871549f, 0.884045010701589f, 0.192617174725234f, 0.226497290324550f, -0.788151335932529f, -0.190538526746651f, -0.556614046330326f, -0.139480186854974f, 0.196785300148418f, 0.978844132512627f, -0.290726060479808f, -0.591813978495167f, -0.0769033757443105f, -0.467044929381376f, 0.171585053083057f, 0.408215527269010f, -0.818706013465989f, -0.328144984930982f, 0.790275356337217f, -0.977491163139178f, -0.979679268318504f, -0.524875121608236f, -0.263859024168277f, 0.0180787743488171f, -0.984390626106750f, 0.952274619010224f, -0.851400664579601f, 0.692959439369046f, -0.150312001943653f, 0.712066554169562f, -0.492336226254660f, -0.453559897031351f, -0.159679763180474f, 0.745834647687870f, -0.725963425297178f, -0.720341794596050f, 0.370674334928492f, -0.845974926208293f, -0.00448769398027360f, -0.595973105115042f, 0.967372249596385f, 0.512949503724102f, 0.889619262804735f, 0.990718232652913f, -0.662246751886904f, 0.333846293708563f, -0.423114421367372f, 0.549637439543149f, -0.987876053136374f, -0.782714958794276f, 0.294868983681807f, 0.931284560597614f, 0.445522387300861f, -0.388400162488578f, -0.182673246109423f, -0.773488958971573f, 0.438788569593725f, 0.578106509978236f, -0.373449127435319f, -0.301996528814967f, -0.227124771031239f, 0.700176189695036f, -0.910948938567526f, 0.733412403327578f, 0.486154072292544f, -0.974058632864456f, 0.216693355653246f, 0.147564301397678f, -0.715192277853558f, -0.366996833259925f, 0.568909126406069f, -0.0810069456450131f, -0.371253841044151f, 0.254736918036059f, -0.868966383080701f, 0.190312518076662f, 0.457253801337437f, 0.941043431633233f, -0.297470749600241f, 0.244270515950156f, -0.240122562119888f, -0.766384662307300f, 0.765045432900429f, -0.608250739173787f, -0.733052557932594f, -0.268433000443065f, 0.733598123424154f, -0.0550005774741753f, 0.273893221740822f, -0.659641650983149f, 0.967032725204337f, 0.390126626361090f, 0.518740746381756f, -0.859387560527806f, 0.554117289841284f, 0.648904904654236f, -0.755880975555381f, 0.834231592524942f, -0.137512395743275f, 0.0477027353535724f, -0.880364563062979f, 0.458763614093086f, 0.650036413308116f, 0.496385905878033f, -0.418537115548864f, -0.565561960782851f, -0.227941684691245f, -0.165031891659812f, 0.204464989908300f, -0.688093624763916f, -0.678874848552394f, 0.813764873880514f, -0.561723359541237f, -0.575805702297063f, -0.288097000970518f, 0.950119107184838f, 0.709879842972902f, 0.730067219897393f, 0.710813066057284f, -0.192333836978130f, -0.190446300563246f, 0.872679304648751f, 0.134143163657763f, -0.979443835407234f, -0.103872104041761f, -0.0568328979324004f, -0.863020133862081f, -0.0257801722427251f, -0.577962771617033f, -0.0500056799801032f, 0.191817418291914f, -0.799853775410853f, -0.110019424741421f, 0.840753817223395f, 0.355588322976119f, 0.274501278628024f, 0.757538306972136f, 0.771547320156202f, 0.0394143752709530f, 0.120744072764658f, 0.324337882930581f, -0.380086709776951f, -0.772025774284869f, 0.473986846199588f, 0.703247561676381f, 0.734667480205300f, -0.594290184210087f, 0.760158653782445f, 0.624553744314883f, -0.941053266957965f, -0.165913770936962f, -0.0497972870738055f, -0.0435608680908517f, -0.663165366083943f, -0.570972482385751f, 0.427845034528880f, 0.0897903148165149f, -0.481825010950428f, -0.0901127105939594f, 0.887770435656611f, 0.770985476674623f, 0.00966158758316293f, -0.331059327378268f, -0.286033645163736f, -0.0698945910210471f, 0.834392309773299f, 0.875537383319608f, -0.657919190548359f, 0.583890957562885f, -0.418481077359384f, -0.282242397022386f, 0.864577023994874f, -0.898367126143440f, 0.815804441243808f, 0.616061408588373f, 0.132365642864798f, -0.221099752471970f, -0.852722283680675f, -0.269499596712950f, 0.360828136129415f, -0.120022743070141f, -0.0354652134632905f, -0.718389836602256f, 0.973490047219112f, -0.201775047168341f, 0.348769511760972f, -0.338750368577880f, -0.269769414088757f, 0.498910931428472f, -0.787648791515347f, 0.508408064858444f, -0.904215976374529f, -0.778575029821227f, -0.662889546847757f, -0.787503064261069f, -0.915166838630178f, -0.415784802770356f, 0.731806835017609f, -0.903922155472207f, 0.0872811033112211f, -0.452516774501827f, 0.577942533813694f, -0.200909337658770f, 0.866167939661793f, 0.982552542055944f, -0.332277333696961f, 0.201673960342839,
0.881239812364993f, -0.0293753746942893f, 0.0967170348490725f, -0.765573023404242f, -0.179225339525953f, -0.931530757069740f, -0.702596334762137f, 0.439106079307245f, -0.469364154277323f, 0.211063395888038f, -0.245858633045693f, 0.936376071219385f, 0.0334087380010875f, 0.0765265939183459f, 0.417091701258078f, 0.962467059286170f, -0.180698008768999f, -0.129816441691123f, -0.833694435146788f, -0.800582099046532f, 0.736376297618233f, 0.0164704176688124f, 0.207462305741760f, 0.300555292898496f, 0.777154212278295f, -0.0804533056660695f, -0.279940128908185f, 0.203101811030871f, 0.447496959357837f, 0.508353359025257f, 0.644333822521829f, 0.897259297488483f, -0.675785952117501f, 0.149337263319588f, 0.350953290584184f, 0.600296681944338f, -0.606098182955297f, -0.418312129297725f, 0.792551232171214f, -0.944025948110651f, -0.923106441737020f, 0.508989820072736f, 0.101554011154237f, -0.799369609980037f, -0.229001813644938f, 0.196367996268564f, -0.634078446275840f, 0.267446716753553f, 0.943765754688567f, 0.329924442019441f, -0.898235312442524f, 0.563592978494850f, -0.976934293161001f, -0.609744819901837f, 0.498989633313589f, -0.105680058480959f, -0.400730747241191f, 0.264919109340783f, -0.313066735594123f, -0.465399967597728f, -0.425123918113080f, -0.609514085808810f, 0.916560800692384f, 0.0173757138934230f, 0.147814399202503f, 0.594152503614559f, -0.145681097751433f, -0.427232299718493f, 0.233460382614713f, 0.337361272635241f, 0.376106438004541f, 0.900277274651600f, 0.424547631957395f, -0.710790444715071f, 0.0846761090154495f, -0.0122707338404220f, 0.119989812955904f, -0.239774389963524f, -0.692300891031819f, -0.735109129583214f, 0.802276300301071f, 0.348982047806247f, 0.916302084278941f, -0.0838164783829127f, -0.989134997097880f, 0.832909602224562f, -0.701363449605445f, -0.150487976031971f, -0.728594035984111f, -0.144393031996783f, -0.458856761770637f, 0.733295441303064f, -0.405608670768629f, 0.522871610912813f, 0.468223399458939f, -0.575139530810903f, -0.241684287862418f, -0.499140599234906f, -0.395586476697394f, 0.692745485195348f, -0.125142235859546f, -0.342212246193052f, 0.133841188490164f, -0.539478395228865f, -0.887973984329817f, -0.474033882236453f, -0.837114132429830f, 0.773392302912611f, 0.117697651876253f, -0.461595011213406f, -0.528669601602068f, -0.957799577987062f, -0.468654423525192f, -0.0602288998398475f, 0.154553704272891f, -0.422854231304259f, -0.496136532114270f, -0.348154983723668f, 0.0576478341707483f, 0.542088962901856f, -0.0465812136931592f, -0.280128217727361f, -0.900695482510248f, 0.525110685457899f, -0.957266165874283f, 0.136490670826643f, -0.213221811269364f, 0.690040133288898f, 0.269408771473479f, -0.0488994830172422f, -0.837526616586426f, -0.289127052660601f, 0.149325279006459f, -0.694169700971401f, -0.0230547571616897f, -0.368313297034846f, 0.344434270521740f, 0.859135365902404f, 0.839336654691204f, -0.511783987355355f, -0.0349625753049687f, 0.935857929664427f, 0.820032045433520f, -0.0394079346656324f, -0.656352913407746f, -0.874383371678169f, -0.425836335156061f, 0.208600154889275f, -0.135596548598733f, 0.566430757256762f, 0.820840891306264f, 0.735746624790780f, -0.765482927015804f, -0.0195537720748045f, 0.606216172027628f, 0.436027839798869f, -0.609233580289002f, -0.963547951222316f, -0.575271468261977f, 0.692873344771925f, 0.143031668657597f, 0.890157114774225f, 0.762299295692265f, 0.653618249618643f, -0.957258626549595f, 0.521895225378123f, -0.607922211531407f, -0.956795748110572f, 0.477633684273092f, 0.794301967670603f, 0.139753218894595f, 0.371726372555490f, -0.804791987531745f, 0.837080126047059f, -0.440992020192054f, 0.584986017638085f, 0.950442046050057f, 0.613109120495913f, 0.633948971396891f, -0.581246845000116f, 0.730290176291093f, 0.599119212595240f, 0.120096101936515f, -0.144169383323758f, 0.930776406826440f, -0.0209712926465206f, 0.572995665695966f, 0.924623298379120f, -0.751832867985678f, 0.630196806059302f, 0.506634179395662f, 0.0388997263873157f, -0.311041196366299f, -0.729049093325017f, -0.918815504666740f, -0.103935429478766f, -0.000623544124330300f, 0.102880227280474f, -0.563637096166535f, -0.332148269587814f, 0.472114131256244f, 0.295717126494164f, 0.246944592105312f, -0.713191555660498f, 0.160410320426559f, 0.110992936470077f, 0.213877527744528f, 0.541660996543375f, -0.872405734998843f, 0.388515073094269f, -0.840811647524440f, -0.968008592072007f, 0.669947948420772f, -0.122943215855172f, 0.565929115911552f, -0.695408966310186f, 0.361296950635219f, 0.574282481983669f, 0.0877180513263536f, -0.694316083550519f, 0.327696487191071f, 0.289746985823208f, -0.241476327174879f, 0.605084742574250f, 0.0929272338220821f, -0.391399761658219f, -0.612928183827531f, 0.0471987261466311f, 0.157388702609590f, 0.575695018001234f, 0.450453491026024f, 0.876623108212541f, -0.456500163180038f, 0.436901006801809f, 0.796734433864345f, 0.771008396172517f, -0.784740610155705f, 0.405172719255834f, 0.958393667559228f, 0.787380105147761f, -0.262826016234054f, 0.773327117333271f, 0.482142068916266f, -0.461607549022954f, -0.153993688218026f, -0.129280134980317f, 0.901812622560630f, -0.111520793491644f, -0.0973214524989203f, -0.293695817178366f, -0.190045093887485f, -0.204792515844396f, 0.501086384719391f, 0.755953359112033f, -0.425886872154604f, -0.0883029298084141f, 0.763071371252921f, -0.556289447935984f, 0.577370462369201f, 0.0480599614417476f, -0.794423686623353f, 0.756645959967545f, 0.570538730848462f, 0.872575422156333f, -0.443572567528656f, -0.0487937634747691f, 0.283986553648095f, -0.170910821134099f, -0.329867000423004f, -0.982322841409943f, 0.555344201026651f, -0.351964643393940f, 0.776172688776518f, -0.148102477734717f, 0.889532618676503f, -0.310979434517253f, 0.711839903052208f, -0.646385596147085f, 0.145592596381502f, 0.233949589173221f, -0.825471565980294f, -0.370248763132654f, -0.777194557275684f, -0.224658064754195f, 0.263281286751478f, 0.849661910468068f, 0.271261490445121f, -0.915885420717958f, -0.947144520818678f, 0.227960459606299f, 0.784463828083640f, 0.995882406349565f, -0.987273766396493f, 0.0792453274840108f, -0.788403526960056f, -0.619975942121645f, 0.801181796307713f, 0.967884377026145f, -0.781223064263388f, -0.300716486479280f, 0.994748932974184f, -0.200152360574411f, -0.101898131541608f, 0.542914585925881f, 0.407729967031792f, -0.105215843903154f, 0.638066037611924f, -0.563777780161298f, 0.134189395993685f, -0.503320561486155f, -0.0379170306314711f, 0.723638115686875f, 0.747948383928228f, 0.928239905995551f, -0.736883772878758f, 0.892242913709735f, 0.468998243295705f, -0.224406388545097f, 0.758754382878863f, 0.994739001052496f, -0.749837906573089f, -0.938777322178786f, -0.619168635741936f, 0.827875717654585f, 0.294033159230782f, -0.372766318349126f, -0.292752124932124f, 0.396629951868878f, -0.986760927173237f, -0.0841834195975009f, 0.999760803826313f, 0.0142305924173638f, -0.820393900206961f, 0.409972278573230f, 0.227315924377402f, -0.641500351639361f, -0.470788010535406f, -0.486171076557593f, -0.758140688442947f, -0.971539708794928f, -0.949039718833189f, -0.146844988902767f, -0.0183627478820223f, 0.402918762093981f, 0.0620266698060286f, -0.182527786403967f, -0.374395326540229f, 0.566584207940253f, 0.879546558847970f, 0.853360173786566f, -0.515321950652696f, 0.511692631053674f, 0.342152084355850f, 0.374686420595610f, -0.794372980760555f, -0.648670375991101f, 0.761192158420166f, 0.223791993225057f, -0.342720055148453f, 0.965612513218950f, -0.796193009647904f, 0.215057114709867f, -0.0459498239576994f, 0.871047701509015f, 0.664672380241520f, -0.546301701630944f, -0.939910946986200f, -0.213195706858966f, 0.559543622118596f, -0.255844807516886f, 0.509576048776352f, -0.699005089750431f, -0.520317652140772f, -0.924306703712950f, -0.923814193467638f, 0.868401299001930f, -0.571229497763863f, 0.984740691690212f, -0.911782692220985f, -0.265295471266664f, 0.0479848731515942f, -0.195328058836883f, 0.758281465939343f, -0.418177229854869f, -0.263323557662932f, 0.0230762644115943f, 0.382605016442608f, -0.576209059863238f, -0.739785100410209f, 0.0956412509899256f, 0.0369702493097637f, 0.0738922616872486f, 0.589371657036664f, 0.548586250623500f, 0.996096574632666f, -0.574178408335425f, -0.827059309028347f, 0.600283403682961f, -0.0651062813338117f, 0.985857002071398f, 0.982700721670305f, 0.777628710286989f, -0.139415722014730f, 0.951156387462424f, 0.806391217144736f, 0.135433009714206f, 0.252388414319270f, 0.485541324740928f, 0.270688932431637f, 0.892850103229909f, 0.440168171407923f, 0.515384398158669f, 0.600884162546465f, 0.947986221531091f, 0.339440884303404f, 0.403857490690436f, -0.937015609644647f, 0.729529495316627f, -0.389601866986821f, -0.420712615666380f, -0.763003723744745f, -0.0619534667970105f, 0.486654476027536f, -0.943536854881494f, 0.471171699317719f, 0.996886209046820f, -0.945316270673373f, 0.230772742042993f, -0.621222111022648f, 0.838934157721328f, 0.124035987915113f, 0.737576768711407f, -0.217898078842006f, 0.0429859145211120f, 0.223685413947773f, 0.820073956039170f, -0.378381145423743f, -0.335672684173821f, 0.649791267584388f, -0.457253860252872f, -0.664776842833046f, 0.150429615666837f, 0.974812973893170f, 0.00119972362050369f, 0.140744912838368f, -0.252632269055503f, -0.124205752907507f, -0.383194456927254f, -0.356455432479067f, 0.0694989880525767f, 0.188230048541949f, -0.854592697407303f, -0.902559387772971f, 0.454054169179423f, 0.534684767654295f, 0.806837289706952f, 0.274203715752641f, -0.765433763984323f, 0.459365005291520f, -0.896797218412250f, 0.382900474341852f, 0.169400421233177f, -0.184111368111075f, 0.0323514487432812f, 0.621015577938758f, 0.139872518806323f, 0.480965263781330f, 0.0649386999855643f, 0.815365754221614f, 0.761990264098834f, -0.0927412249348933f, -0.580853742457387f, 0.211615321410605f, 0.165159968106305f, 0.305515629345863f, 0.725748395743965f, -0.667649812347274f, -0.621843189978885f, -0.939317191264789f, -0.197108718554958f, 0.902152006895939f, -0.889744652803018f, 0.667113256888905f, 0.929471703711725f, 0.660025836042506f, -0.0712223078913006f, 0.416152292126436f, -0.602223852277700f, -0.828462878627106f, -0.956915163338265f, 0.298196541541469f, -0.933863927954050f, -0.198745190221695f, 0.749101206471011f, -0.922366396086261f, 0.769953026855636f, 0.971459582749177f, -0.226637139032289f, -0.593509265485619f, -0.635649447577657,
-0.443127775644156f, 0.350464269654307f, 0.379979516655134f, 0.896282784801247f, 0.00871209446887344f, 0.401818712823609f, 0.815422566258939f, 0.215868289995843f, 0.682217845700443f, 0.508819667108007f, -0.988484263336122f, 0.216656890144568f, -0.185777888700071f, 0.522106353117928f, 0.894211314619113f, -0.779300881699217f, 0.137801937535128f, -0.818740955579722f, 0.637214461095055f, 0.187867696634722f, 0.184985729971243f, 0.315323389557324f, -0.0312525033775366f, 0.498559120407008f, 0.855778208118391f, 0.936851170962385f, -0.0524308158818188f, 0.257087262622978f, 0.816141818246927f, -0.147192803443011f, 0.194545158383538f, -0.655428449892669f, -0.650441844539509f, 0.536015423540886f, 0.0250060573607953f, -0.863380305825989f, 0.0605420782823460f, -0.963662464088496f, 0.689136717877590f, -0.929664162821947f, -0.327349437742288f, 0.713122240487331f, 0.765587094162777f, -0.314350325341316f, 0.409992519686522f, 0.753377832105546f, -0.756848529995586f, 0.760787899507869f, 0.512213162407276f, -0.674820237484644f, 0.560776719592082f, -0.874905891603855f, 0.925202682923872f, -0.907405002733482f, -0.575836335118172f, -0.248173888600965f, -0.187923239740639f, 0.230951002247789f, -0.540190666146588f, 0.390890663320481f, -0.705511708249712f, 0.0980457138183717f, 0.879979753648798f, -0.378326046226794f, -0.645363625221967f, 0.883365508962968f, 0.728720763588748f, -0.191571576393619f, -0.941989254130187f, 0.944312154950866f, -0.367184985473008f, -0.974124559264444f, -0.579946765132286f, 0.509825236656578f, 0.952047194261820f, -0.0955445631918663f, -0.00500764501201401f, -0.00111382665477655f, -0.0404281661495578f, -0.265706359102834f, 0.865881843285797f, -0.947915521623861f, -0.820337973623839f, 0.0843747524022067f, -0.948599514028391f, -0.464018526769358f, 0.600790429663803f, -0.0779017384430381f, 0.756949801920938f, -0.955436496929340f, -0.553346424499498f, -0.401256107066610f, 0.569624108543687f, 0.179455179577041f, -0.189386842296675f, -0.467166492259358f, 0.367644583467601f, -0.722338735126514f, 0.863903729827081f, 0.0631027352569811f, -0.982269235503679f, -0.837788470642698f, 0.421730643738386f, -0.671745211565315f, 0.858467932275763f, -0.745298219348761f, -0.659594977600028f, 0.403238381269873f, 0.951987904652099f, 0.228887404582426f, -0.331665752024408f, 0.794789885033899f, 0.669978127515269f, 0.977583870328654f, -0.346398989178462f, 0.692053246433782f, -0.159407706019695f, 0.710808563527500f, -0.555701359319642f, 0.625665798239905f, -0.711048329414687f, -0.672431532474912f, -0.474897384314332f, -0.196250611816064f, 0.902140605659856f, -0.459732035217428f, 0.651412290305649f, -0.686137550630920f, -0.803228611526547f, 0.371120664039117f, 0.289869860968561f, -0.720979161638185f, -0.0940498575417996f, 0.185025844935128f, 0.401524077274769f, 0.811721346556136f, 0.224659861626089f, 0.106438807548742f, -0.117458956991326f, -0.407361487623449f, 0.683891165426988f, -0.216582410631386f, 0.710644530504861f, 0.867797453793643f, 0.626683550176870f, 0.115061097783331f, 0.976742668387085f, 0.250700864990527f, 0.272723539841862f, 0.159923684669346f, 0.167713264013185f, -0.445764377935606f, -0.489538472614810f, 0.227880894824940f, 0.670702116476237f, 0.610361511284318f, 0.503801949624464f, -0.687816091694902f, -0.0413765153535617f, 0.155769004545734f, 0.921910233366689f, -0.467299226678025f, -0.991984541712805f, -0.527009262324220f, 0.248157897392517f, 0.661145853979517f, -0.975947426744844f, -0.242453990684693f, -0.277956284573619f, 0.162010437415540f, 0.889456199489152f, -0.171259539670729f, -0.0636124576727060f, 0.311318764402696f, -0.227771282875219f, -0.567702050585727f, -0.132881625149059f, 0.870846950418812f, 0.440078398779761f, -0.0908818839265000f, 0.410077545060762f, 0.917678125288724f, 0.975295290129489f, 0.736514272579886f, 0.653896379317074f, -0.166512942888681f, -0.218665383726096f, -0.0688642360506688f, -0.596589868100824f, -0.180873413844075f, 0.229002598511067f, -0.647630976455599f, 0.722615884501717f, 0.760194030884127f, 0.253262836539679f, 0.0734191803957118f, -0.941427952376035f, 0.224118866807764f, 0.634990976599086f, 0.538622500570355f, -0.591487367587299f, 0.829253069890529f, 0.426659996899884f, -0.562435396124737f, 0.924178169394878f, -0.693964899988321f, -0.520472617448914f, 0.845157115508053f, 0.162984246343684f, -0.212032053476592f, 0.0482566706558292f, 0.820584028875367f, 0.676120066619505f, 0.590174358812695f, -0.457289938956925f, -0.351282540371674f, 0.322162683499620f, -0.683726196205246f, -0.279636659553935f, -0.186133028676429f, 0.965481755833750f, -0.0550172560314044f, -0.437844829991532f, -0.448670532146325f, -0.438916826946834f, 0.830205353164842f, -0.0125988502002286f, 0.733716462327519f, 0.870000673588185f, -0.189915082276716f, -0.676269331249200f, -0.336432931956768f, -0.288892891213265f, -0.912569275291884f, 0.509853767908707f, -0.658452317958678f, -0.562848133961047f, -0.102082581799095f, 0.904062026055565f, 0.473339990381854f, 0.210234896873676f, -0.0884007008398613f, 0.720872020499257f, 0.538315255331760f, -0.884485227439286f, 0.160844002639634f, 0.625863524205804f, -0.947487159926400f, 0.362643826956149f, -0.189913270725334f, -0.110428721523612f, -0.666510263156819f, -0.214827103263521f, 0.912669747474334f, -0.973896103049543f, 0.665373714127588f, 0.148135031012834f, 0.126524689644449f, 0.00283763548841764f, 0.312700495893193f, 0.579520771033243f, 0.677583023476560f, -0.779567427807191f, 0.0694994546110597f, -0.298762697062437f, 0.655210050716681f, 0.435909078048151f, 0.322095567178671f, 0.764827170021089f, -0.713736794113842f, 0.992844460358584f, -0.735915506109616f, 0.280204875392391f, 0.584446532772711f, 0.796955505835788f, 0.742508124239176f, 0.0785523490091065f, -0.562359397016753f, 0.874448473576734f, -0.794251927759664f, -0.658767152705445f, 0.120015806343044f, 0.662372174700575f, -0.719334975225296f, -0.663474261357014f, -0.637663874969148f, 0.706137632813821f, 0.734790814693796f, -0.449118755654663f, -0.758125670003823f, 0.719059339327447f, -0.228679956701166f, -0.0782671261690160f, 0.637830522744746f, -0.178696376536345f, -0.848273935253246f, 0.840882430630200f, 0.977813953976437f, 0.565474986185913f, -0.807314895274907f, -0.100534840844589f, -0.436186956483089f, 0.854663592026441f, -0.547576146320248f, -0.621784076386717f, 0.688687549426321f, -0.688962085987764f, -0.998914668418794f, 0.751493418398842f, -0.203018738091861f, -0.881317097659280f, -0.422480898609404f, -0.321074554557095f, -0.759379357125740f, -0.806503084491033f, -0.496837315822352f, 0.217087355208111f, -0.776801484423500f, -0.445747498145286f, 0.710204776554782f, 0.274276964033182f, 0.650397224484409f, -0.709395921248168f, 0.862663541330686f, -0.946166202558813f, 0.826638502366159f, -0.450587332736099f, -0.808257632193740f, -0.414360554482101f, -0.471118187583276f, 0.981592919290155f, 0.192794908371370f, -0.314979855997427f, 0.722518962804398f, -0.795914669179603f, 0.121447532644509f, 0.0446893237592363f, 0.651720955387594f, 0.897128141094619f, 0.283834144643742f, 0.369570391543943f, -0.163784005163726f, -0.799144231493300f, 0.338136741961422f, 0.795991730702685f, 0.601735561139351f, -0.556654767533027f, 0.907044495725416f, -0.374604065784494f, 0.814308532452677f, -0.254295412850351f, 0.443103437041340f, -0.0218296619602199f, 0.826728672505738f, 0.773205771668962f, 0.171909022893217f, 0.497670481959597f, 0.954178712898056f, 0.0840098577761919f, -0.705861127301893f, 0.145663865959608f, -0.436204975766037f, 0.479359595998989f, -0.719493824988072f, -0.523146212355768f, -0.917822711649927f, -0.610003715217602f, -0.192266667446473f, -0.377507163265653f, -0.250419291332051f, 0.873627391381727f, 0.922899703740095f, -0.902411671519496f, 0.285830821349708f, -0.577368595723736f, -0.598296174995687f, -0.0152478418690674f, 0.503725955636280f, 0.946501779740920f, 0.261108140547963f, 0.206258978593364f, -0.887022338332430f, 0.989187042741485f, 0.461764104690670f, 0.305280284664753f, 0.243972878436235f, -0.573704516784209f, 0.111805651228880f, -0.373590027525854f, 0.574564836347642f, -0.712884790778729f, -0.0570130063179222f, 0.244209425500712f, -0.717492787619277f, -0.476920207759357f, -0.444169983027413f, -0.254851417015366f, -0.505678630542571f, -0.953549022234155f, -0.0316841901798541f, 0.198256779602804f, 0.151938229162240f, -0.0259028503944394f, -0.799645893003010f, -0.889308912372168f, 0.339221517072804f, 0.904784479404768f, -0.367330903112591f, 0.866281762131661f, 0.112765232993802f, -0.0852946527317187f, -0.283538359072154f, -0.734951426632046f, 0.502970854898684f, -0.541434927857400f, 0.881496286285600f, -0.227404039639917f, -0.636983936776183f, -0.0799774217214970f, -0.833780310813424f, -0.222787370954425f, 0.433143783060434f, 0.0953330524947187f, 0.965400264971588f, 0.308927931247299f, 0.344316393259575f, 0.122880788538352f, -0.898509922382301f, -0.187062523329053f, 0.705352247460646f, -0.817811000761718f, 0.303714513401701f, 0.714863075518907f, -0.00862372607283035f, -0.842715848975590f, 0.816504077307885f, 0.924594085591125f, 0.334618732730041f, -0.212414743241377f, -0.758289625449925f, 0.586405661412351f, 0.909247363444287f, -0.800422609846793f, 0.397430897916299f, -0.408827454151232f, -0.411913213123543f, -0.602703152770135f, -0.893591462026327f, 0.417648762458765f, -0.766362696266534f, -0.166060103951854f, 0.883234167729589f, -0.0741908774062401f, 0.113912882075078f, -0.268248292164738f, -0.825585719915457f, 0.885446166477969f, -0.996523379251940f, -0.000841720632677401f, 0.940286529247477f, -0.528330498750176f, 0.0938880690147421f, -0.966296878893937f, 0.891956527154360f, -0.483384605653306f, 0.257210342748458f, -0.820220338820906f, 0.363913841603935f, 0.0364865250689275f, 0.0619156958713947f, -0.645447937080250f, 0.548279343062761f, -0.289526240449473f, -0.506780094171335f, -0.901771170107367f, -0.437874075223813f, 0.748512212111141f, -0.529884246718074f, 0.924062132675193f, -0.365432219122282f, -0.263296006595835f, -0.927083881647913f, -0.192737974697553f, -0.450051159199964f, -0.543528645806642f, 0.834976909049276f, -0.426975046433596f, -0.361056079272416f, 0.883880063360531f, 0.680380429911630f, -0.553642515320953f, 0.548847108935282f, -0.357430246936948f, 0.210445016993628f, 0.949511601115471f, -0.611278947360487f, 0.344744934459962f, 0.0684247970496175f, -0.877154656281116f, -0.521992702610556,
-0.0303764312006813f, -0.647220068176984f, 0.693175336224119f, -0.0955602614554496f, -0.765579758912278f, -0.821318118938906f, -0.220936603794347f, 0.159013709512021f, 0.0222743973539492f, 0.569438412513281f, 0.896083437551563f, 0.973699071868637f, -0.403438951991928f, -0.976931032127622f, -0.0720613180573018f, 0.0788813367661694f, -0.430781354548607f, 0.580378296309349f, -0.175446689199481f, -0.256743557012462f, -0.696667845393283f, 0.870473046831235f, 0.146660713923108f, 0.277741407197705f, 0.502075064404417f, 0.396530064046844f, -0.000209092342246420f, -0.977003947244262f, 0.451457326960000f, 0.420509664462095f, -0.0826395067671402f, 0.461120688156973f, 0.786867285802415f, 0.429254905841222f, 0.894426863739026f, -0.670297281923597f, -0.833650409296060f, -0.908588009702110f, 0.516311115539149f, 0.975234001829324f, -0.532953533466378f, 0.775291582519158f, -0.0136022600428900f, 0.654817093112596f, 0.363512141498233f, 0.624779024037534f, 0.0237004661473674f, -0.172570506046968f, 0.401807838319043f, 0.997391258152958f, -0.553969395939123f, -0.415425175833161f, -0.758032843655304f, -0.482766088920005f, 0.637574309072414f, -0.729000055114342f, 0.699851428676091f, -0.827508053421131f, 0.900655803848482f, -0.431149800814228f, 0.0369409101983413f, -0.378608101457895f, 0.237564147838841f, 0.533020461112441f, -0.280269627508005f, -0.864065787343603f, -0.0381481642453043f, -0.566886547530062f, 0.539727700361167f, 0.166859339425035f, 0.850080295054718f, 0.384690146030125f, -0.384995288415294f, 0.303656036600558f, -0.580297619022502f, 0.0649069482840878f, -0.162922327392773f, -0.235019427063355f, -0.265468718118809f, -0.121827312187455f, 0.0416628805824146f, 0.343481543012411f, -0.251429566892972f, -0.868100204320718f, -0.802636407512128f, -0.549547579028752f, -0.570017983863503f, -0.853634311513627f, -0.564570567173235f, 0.955944215494794f, -0.0930750790375956f, -0.160319122401953f, -0.640886790354213f, 0.798634607857513f, 0.503051518023559f, 0.765247226736789f, 0.909476811674882f, 0.677590253114963f, -0.110641683440517f, -0.336445241915220f, -0.684064840782028f, 0.962285048920031f, 0.883303701653897f, 0.981819291389659f, -0.597290928759656f, 0.215792997443025f, -0.847656608719347f, 0.679887992445640f, 0.299901700372808f, -0.677306526467426f, -0.348340058872692f, 0.651490451411335f, -0.133387041637395f, 0.718311240322040f, 0.0869279817052975f, 0.155413706090559f, -0.869119988858735f, -0.566773040844476f, -0.0513826414151206f, -0.368087669232071f, -0.978175512831125f, -0.229213501073727f, 0.344608572405871f, -0.663307667219997f, 0.437238632879575f, 0.00205230197288353f, -0.0897076092856746f, 0.834529513214144f, 0.131872357342232f, 0.113081940417244f, -0.418620232731326f, -0.317993033651213f, -0.740303025960662f, 0.423423655701288f, -0.300833032468860f, -0.458960388256530f, 0.692670405117589f, -0.559944357561921f, 0.0168623577148430f, 0.568661331088367f, -0.385055363002398f, -0.356055436463140f, -0.794446573681063f, 0.908870080953069f, -0.295500656666577f, 0.800625150733729f, 0.206307902542489f, 0.729591183391974f, -0.0655746333947396f, -0.261707022686154f, -0.802380330579914f, 0.0812359238243023f, -0.00528231140765212f, -0.725740453383981f, 0.919076065030463f, -0.896497189839174f, 0.861919731820265f, -0.804273875755869f, 0.230339021648310f, 0.296779613186519f, -0.349872572510143f, -0.270230381483447f, 0.0368924200249658f, 0.581340248642417f, 0.943620537648739f, 0.715012058065301f, 0.528414993233909f, 0.695917111744314f, -0.634354198968852f, -0.483786223099716f, 0.565405035681248f, -0.530076864213017f, 0.363019522302994f, -0.825556544716473f, 0.891096876998683f, -0.990692760548295f, -0.450641405862313f, -0.597008073985341f, -0.464377765418678f, -0.942926913464693f, -0.871399725569805f, 0.232335933943403f, 0.858786794807406f, -0.528589179815518f, -0.324757177062634f, 0.595880088750788f, -0.976574570427974f, -0.423824220654658f, -0.832990206908489f, 0.198704682807118f, -0.168244652325292f, 0.843066822744011f, 0.0912498543932607f, 0.485570815146582f, -0.104653316420662f, -0.623461298489716f, -0.807713596811018f, 0.737782734425857f, 0.456364368166532f, -0.430703367862900f, -0.188953991637209f, -0.827984282695373f, 0.0246267653665548f, 0.891225605267640f, 0.910600867999638f, 0.345236086687552f, -0.600682365520065f, 0.833182106437698f, 0.213749250288017f, -0.0866339102562885f, -0.618385082289017f, 0.859527120927500f, 0.749978780964161f, -0.334770513867011f, 0.242140166670949f, -0.196268320459958f, 0.611789869603675f, 0.655057159657307f, -0.603759576722096f, 0.614654509385217f, 0.144145218488192f, 0.959930150756613f, 0.485009777784726f, -0.564230295010912f, -0.404716165405314f, 0.0442672151313601f, 0.929486639423805f, 0.409386317338224f, 0.527053707674182f, 0.899087569745327f, -0.933259779365388f, 0.265159475034860f, -0.858300862890810f, -0.870994388031662f, 0.354868177430506f, 0.00956840260511749f, 0.429740959889133f, 0.649668163567379f, -0.744532888765288f, -0.967499901569196f, 0.556703631745254f, 0.535130550118618f, -0.639502350153040f, -0.604586469532735f, 0.0799683564329623f, -0.156074786599444f, -0.348308700325411f, 0.217829052228100f, 0.545642400171123f, -0.303317700019152f, -0.473220675222451f, -0.239688108834945f, 0.0998500862725149f, -0.962734081833842f, 0.870743993144299f, 0.464578557934316f, 0.184511089576136f, 0.559729843314504f, 0.0702052363354577f, 0.632714874625648f, 0.212930743289312f, -0.454606863365109f, -0.592679055778218f, 0.287649993384466f, -0.457293694071368f, -0.423493046785686f, -0.0674763327876298f, 0.242131064298176f, 0.488581911885965f, -0.464567743213882f, -0.387515661812354f, -0.914585596974616f, -0.255803162310627f, 0.941267268311980f, 0.690278917089395f, 0.302397314111962f, -0.178461434689705f, -0.949279941481428f, 0.160440202901122f, -0.970582196769486f, -0.0119478205074164f, -0.206440255898676f, 0.221640403444713f, -0.819801447827624f, 0.263614394802488f, 0.616376195532700f, -0.596859494305351f, -0.118659509995453f, 0.458168997595326f, -0.0400474705134108f, 0.934465050133603f, -0.852936731989621f, 0.0191637795580570f, 0.298534793677081f, -0.857491630206749f, -0.0141198383157879f, -0.365027350962024f, 0.450964838023674f, 0.351383095290905f, -0.387039947149600f, -0.983994933095116f, 0.610531582220017f, -0.0446025524732094f, 0.216718014780746f, -0.676819246943449f, 0.0385619292249610f, 0.192482456707739f, -0.288809653393521f, 0.241774557042318f, -0.444638770943313f, 0.535319194413803f, 0.374773141606987f, 0.186364279454450f, 0.0701814972821988f, -0.452753172654203f, -0.350918291268194f, -0.332963791049667f, 0.179301863965318f, 0.954101654404080f, -0.687960044344130f, 0.611454049205213f, -0.696789567124132f, -0.551566492897529f, 0.656434797122885f, -0.601779335396959f, -0.265656331560395f, -0.528821434638507f, 0.153601151147409f, 0.514739334540489f, -0.0517769842323894f, -0.659246830986894f, -0.453055366696259f, -0.0515886000780059f, 0.958478845408115f, 0.0221452906045994f, -0.159960643390796f, 0.816263632871352f, 0.245244170325114f, -0.0919839688704780f, 0.947170598807362f, 0.846772793441790f, 0.247105133025056f, -0.801972939368103f, -0.224977420586025f, 0.130099925027197f, 0.497816036746753f, 0.308139730113712f, -0.0536876417759813f, -0.492022090866895f, 0.188938438822753f, -0.400894058284033f, 0.314370104391157f, 0.618580768947071f, 0.830051263404639f, -0.228700130023340f, 0.811855169643177f, 0.0924092179787017f, 0.273652523319809f, -0.0624274843235475f, -0.503696982048589f, 0.510545161203341f, 0.341823133345436f, -0.437486933663093f, 0.0134072800031224f, 0.613837993234983f, 0.740945655313894f, 0.135311460882606f, 0.464832228842466f, -0.973962843371452f, -0.519388256678232f, 0.631469277357519f, -0.936937468616713f, 0.208677911871604f, -0.0946010975796272f, 0.560587233611855f, 0.230925763372331f, -0.637408482848184f, -0.679175194353885f, -0.408696637706987f, -0.0837464598184048f, -0.911070817707239f, 0.985815432104941f, -0.208807972878988f, 0.741966810464688f, 0.162772839973564f, 0.717702638881939f, 0.490767958961575f, -0.835565390813677f, -0.878516167634055f, -0.956727838876563f, -0.00772081382858891f, 0.355227897612178f, 0.202889185809854f, -0.431078767653467f, 0.106936101717808f, 0.354494042302258f, -0.619623833602791f, 0.193065593078352f, -0.105803087758606f, 0.151828327005194f, -0.141094922099930f, 0.847569902283069f, -0.656683924792181f, -0.880754505470701f, -0.421714047610595f, 0.681762288858050f, 0.633712681698887f, 0.947060360650644f, -0.959122611588459f, -0.0690574969687099f, -0.805062392278087f, 0.226501754467861f, -0.414732397455275f, 0.242398867364043f, -0.831838824773804f, 0.00787391802290793f, -0.860692119913991f, -0.391321299589110f, -0.0548681430681355f, -0.992920640472037f, 0.0975642331777702f, 0.894630836703243f, 0.767919825689366f, -0.260878774442215f, 0.407457430171103f, 0.140688657702825f, 0.737494845272763f, -0.650969054257040f, 0.230613259000797f, -0.0986876345046772f, 0.0996951163848971f, -0.679173062298700f, -0.760174222364469f, -0.613840714529317f, -0.692138390397415f, -0.0919103790884603f, 0.0259548517830916f, 0.463763807478796f, -0.859327137970617f, 0.298600182982665f, -0.591236092977368f, -0.994984881037264f, -0.0533840054951049f, 0.544979189292485f, 0.652482875230260f, 0.897548627394727f, -0.340241293753474f, 0.508237349558163f, -0.611986702936889f, -0.399952468536369f, -0.758494484998191f, -0.148960755782999f, 0.895231513826071f, -0.870487943961511f, -0.172763884748068f, -0.652702954266129f, 0.784450103085903f, -0.428504279168614f, -0.347266234450861f, -0.0897193897382391f, 0.760686883857503f, -0.0863659842493281f, -0.453544362916610f, 0.713112885874267f, -0.529914378597266f, -0.134507787695203f, -0.590955798880753f, -0.372583442870916f, 0.646730663631020f, -0.809515553972267f, 0.0226873348847205f, -0.209338539804651f, -0.737170063193136f, 0.365916689978321f, 0.658019395382111f, 0.733982378695990f, -0.579926149814113f, 0.973814182111372f, 0.933875763922095f, -0.985234946636757f, -0.103124599698243f, -0.798304574918884f, -0.119705341414667f, 0.205941898284561f, 0.111088288053652f, 0.418598493379981f, 0.309112287901667f, 0.0865232803642195f, -0.281174085998345f, -0.158426951248790f, 0.156672456990889f, 0.608691108739118f, -0.124654784531448f, -0.372060827503666f, 0.555750853569654f, -0.481715370485256f, 0.411012047999522f, 0.265636511301544f, 0.164466400718006f, 0.427292785417094,
-0.407665783814271f, 0.0463239131527564f, 0.0109249300633605f, 0.0949704798708169f, 0.223291931618591f, 0.708651599857453f, 0.810927407452143f, -0.298811874805995f, 0.347215272448441f, 0.778225160999446f, -0.981258755328673f, -0.629231280170021f, -0.948786159268210f, -0.0530522786747270f, -0.665046033882002f, 0.776993795678436f, -0.604492154463805f, -0.906360689482177f, 0.543616910115371f, -0.501547360013149f, 0.571784796850774f, 0.868511495621889f, 0.783008382563488f, 0.571870376568081f, 0.0471150346240308f, 0.402433510592678f, 0.661353159662286f, 0.0253381317208246f, 0.720141243708461f, -0.478805385943742f, 0.989639021624774f, 0.538614599364854f, -0.282810721919526f, 0.888399971333007f, 0.118572990347886f, 0.564528382703688f, 0.988296121763412f, 0.509638594649021f, -0.797738059997026f, 0.0363326380089621f, 0.978315833815278f, -0.483368013204689f, 0.879051054425480f, 0.632539830439323f, 0.722677742708361f, 0.578919286433726f, -0.250721628167261f, 0.534435049744896f, -0.0404568429105234f, 0.00805525426120179f, 0.841210870775473f, -0.731771544679396f, 0.713758914490801f, 0.830250762535296f, 0.436563669872217f, 0.567024378980237f, 0.983941121609744f, -0.253548560865555f, 0.647105012325159f, 0.434994339049196f, 0.130837710207442f, -0.775136733344706f, 0.234917279141211f, -0.498429841761386f, -0.273571256415041f, 0.247467425899991f, -0.970396693506149f, 0.975835855884816f, -0.347896516486866f, -0.552856369180847f, -0.887336234316568f, -0.573271015958957f, 0.910862901097874f, -0.807236601077904f, -0.523971593712952f, -0.263589563369279f, 0.591056276091253f, -0.320168527954128f, 0.726795865615521f, -0.731502115921006f, -0.942225519371229f, 0.268573107637337f, 0.380348127119473f, -0.284539943611895f, 0.117478291379931f, -0.817442486350524f, 0.0734705767013011f, -0.626880755668906f, -0.873066996524459f, -0.528675805715351f, 0.490255491577847f, 0.398142666604162f, -0.911320079669940f, -0.870350237514323f, 0.854587452657144f, 0.736349579728106f, 0.948232845958681f, -0.00126774478569258f, 0.905641169934000f, -0.965500575551565f, 0.0831330388550517f, -0.892713267782484f, -0.277958019172831f, 0.312987842344813f, 0.484268977417485f, -0.365960524226328f, 0.177956605738091f, 0.913776767689874f, -0.897537691614058f, 0.473075982698961f, 0.913190042662185f, -0.00843862630950820f, 0.972679442298938f, -0.856058592202917f, 0.264007224067230f, -0.138444823656136f, -0.386195416368251f, -0.286657907928107f, -0.231200657384828f, 0.917365701941188f, -0.271317547281263f, -0.252691685075831f, 0.893742787021399f, 0.512463051119608f, 0.979155111008605f, -0.472272776864686f, 0.238767541974988f, -0.672234403865928f, -0.846783135777377f, 0.0877594573148737f, 0.493055606176910f, -0.289012308379085f, 0.416463895880697f, -0.0795051375851281f, -0.476692131327163f, -0.430471976159529f, -0.701875030095239f, 0.724684336417516f, 0.984802039066595f, 0.798285421773762f, 0.000509924988974175f, -0.0852199551444761f, -0.709724122158260f, -0.332735158942919f, -0.741119907407496f, 0.729608513555970f, 0.500578022862182f, 0.520862987462710f, 0.565678561009731f, -0.393741545311224f, -0.568866018100912f, 0.571654318026290f, -0.817900961532165f, -0.793268461448962f, 0.614914392385859f, 0.763415306986536f, 0.450074180772758f, -0.737435729799608f, 0.841185794339245f, 0.894276069286366f, -0.276262284222369f, -0.798623475612628f, -0.280994234105732f, 0.821175230597885f, -0.474251640366966f, -0.190039801864015f, 0.0663032720971493f, 0.884162053156770f, -0.162023139878049f, -0.963135153785511f, -0.582213329804047f, -0.328536493809765f, -0.938405687658462f, -0.0171569611327957f, -0.727260847907578f, 0.419920927745257f, -0.361592243835530f, 0.476989471873569f, -0.146161675185107f, 0.431817832405826f, -0.371528849369885f, -0.940567978751516f, 0.165203770962029f, 0.781321525273307f, 0.0585592625092357f, 0.573299596753579f, -0.378869924017182f, 0.523139576520889f, 0.385605607116478f, -0.235893429970747f, 0.285814921067909f, -0.121941292771133f, 0.621558611608942f, -0.0860979132283732f, -0.627097832687809f, -0.312083243705910f, -0.494490796681559f, -0.987187334387934f, -0.0804474888246625f, 0.496400656176795f, -0.851811189314651f, -0.791398271297849f, -0.868174317799275f, -0.226794668997878f, -0.335339474552766f, -0.276765924750817f, -0.395876032147377f, -0.740529136126816f, -0.167799472110453f, 0.593129248263724f, 0.336783120133436f, 0.248892158925787f, 0.950120283075237f, -0.795216613504226f, -0.574731116508357f, -0.822689608026685f, 0.973698546284335f, 0.125166556654624f, 0.588150318080073f, 0.128654744345192f, -0.219207714307262f, -0.271053050307713f, 0.124071241265810f, -0.618209718015327f, -0.766619799595349f, -0.478340220431165f, -0.446873929629545f, 0.978019432749647f, -0.627041040766022f, 0.169323691066764f, -0.714079827532216f, 0.386101296128268f, -0.360225804976135f, -0.236797717782837f, -0.311635747131794f, 0.0482888201705840f, -0.477302740867809f, -0.427349080854399f, 0.390352470816329f, 0.611790541936623f, -0.648292156214605f, -0.345871618789073f, 0.509300603302844f, -0.0142202703124219f, -0.570248077753979f, -0.0629178211029751f, -0.737806048037047f, 0.497750084049821f, -0.761650107803135f, -0.788756591098617f, -0.994497286039420f, -0.987344273533962f, 0.657151987467984f, -0.763708299084062f, -0.0729359162118841f, 0.0455275633022023f, -0.101919187896584f, 0.457804242981095f, 0.0117715388281796f, -0.274125197027132f, -0.949738804931191f, 0.762108173886486f, 0.405150754308562f, -0.733330375873553f, -0.712774896799572f, -0.791947616412901f, 0.444023894424500f, 0.00507562975249609f, -0.900698136223538f, -0.576055334977054f, -0.948895529956106f, -0.832665060374124f, -0.992753953473078f, -0.0674086978315183f, 0.569494111501383f, -0.962269067721443f, -0.489700810475570f, 0.972626508328545f, -0.777400448149780f, 0.115588644128954f, 0.0730469703310024f, 0.523584488072518f, 0.659055312807301f, 0.134198234373838f, -0.797833055125151f, -0.167842823235145f, -0.662347837139732f, -0.537544370279756f, -0.622353549740796f, -0.789789664448618f, 0.985300123665319f, 0.862449845163424f, 0.973193986256980f, 0.148883268671144f, 0.283619537155083f, 0.508503183151258f, -0.246167305966866f, -0.259543094514413f, -0.778029136807597f, 0.128978622849116f, -0.920978818238085f, -0.116324837544276f, -0.261472397833253f, 0.772449038068069f, -0.696754008784325f, 0.980778877985902f, -0.227636956328402f, -0.472493776528032f, -0.568519858000960f, -0.151689463117960f, -0.102997587484899f, 0.464752146042376f, -0.839114793935065f, -0.0325074343587592f, -0.180618880765978f, 0.0132253638432844f, -0.646173464496730f, 0.821983901071593f, 0.657453744559881f, 0.786315172070382f, -0.438718096604728f, 0.702691078885442f, 0.859957412428682f, -0.505281395658564f, -0.236722160990303f, -0.698465568366759f, -0.746418979540090f, -0.218205126412646f, -0.808715244840435f, -0.949813739800491f, 0.176975348790769f, 0.723960974918154f, -0.139253733704369f, -0.387224393658603f, -0.869945438924443f, -0.396979039594941f, 0.0256060022407458f, -0.566074790002811f, -0.161564565183606f, -0.736189868188370f, -0.205593811665825f, -0.628996407588712f, -0.0266462623004120f, -0.344127255771429f, -0.229003801178142f, -0.469786561635510f, 0.258249378153965f, 0.160442939158622f, 0.0528817242116550f, 0.261960766261548f, -0.571069557415276f, 0.411333771884545f, -0.145205354714326f, 0.249324532476397f, 0.163889600722793f, 0.649915677347011f, 0.147077371087195f, -0.227104208942068f, 0.867390199578604f, -0.0734153565896754f, 0.0491208061060167f, 0.0360590744216485f, 0.181620126101180f, 0.0567549454976457f, -0.856976992549465f, -0.242511192726339f, -0.624770508991394f, -0.793161214564285f, -0.251208532727981f, -0.833192309869275f, 0.368166434661069f, 0.939730260791580f, 0.305796202211942f, -0.598830491282818f, -0.0575368190467946f, 0.371329658849021f, -0.227872714677810f, 0.707539568196379f, 0.795186297468385f, 0.475847791658551f, 0.829361555893632f, 0.405386540930889f, 0.213282954068900f, 0.767339023510319f, 0.525055513018554f, 0.259437496637378f, -0.524342591286100f, -0.731515526086696f, -0.233118783725590f, 0.237972339628935f, -0.933985285078109f, 0.537013420173496f, 0.498819465200784f, -0.407713459607516f, 0.382821417923595f, -0.416894700661466f, 0.0787266904103943f, -0.0627973593192392f, -0.320105342653426f, -0.844066834407447f, 0.138221622417319f, -0.676665423871596f, -0.961043785105959f, 0.832268610130385f, -0.905530890441773f, -0.114191325652611f, -0.376697124207843f, 0.390323137798417f, 0.953143142925101f, 0.983427991280007f, -0.0895687386326503f, -0.681543125061097f, 0.677131540142176f, -0.867715848764628f, -0.812718786220309f, -0.212509939486840f, -0.990002327123638f, -0.0682855560011961f, 0.129310729289606f, -0.623746296335073f, -0.285580241032587f, 0.235626081900812f, -0.611973228709249f, 0.539189737955466f, 0.970058678533189f, 0.901944358898624f, 0.168094826408153f, -0.666711281252260f, 0.965612752173968f, 0.651034558458719f, 0.687501917067508f, 0.758614314567106f, -0.839396045781239f, -0.552775028233564f, -0.528941743867256f, 0.174761156721889f, 0.243585712774679f, 0.588913151268911f, -0.306898192880627f, 0.921540023069231f, -0.0223654942298541f, -0.102408576957649f, 0.612577852207921f, 0.835809058447089f, -0.437118459197839f, 0.455316033239981f, 0.311435507416257f, -0.648992336007256f, 0.346823844785409f, -0.632080213667648f, -0.599678627679202f, -0.653822991854328f, 0.484305292443427f, 0.782046295685087f, 0.960987598814982f, 0.627169162605570f, 0.948092598306120f, -0.185268381817018f, 0.602489977060513f, -0.885827813790617f, -0.00179203147433582f, -0.175476447614991f, 0.0461282236560925f, -0.898013889602944f, 0.256310837914276f, -0.733422110056865f, -0.740091677658095f, 0.966724540497493f, 0.328056986822768f, -0.267854591449557f, 0.670545831663244f, -0.356204313297688f, 0.0729865206358908f, -0.594530723723669f, 0.519965324048968f, 0.0632129606097647f, -0.878434885663544f, -0.497945943395010f, 0.0151854050905818f, -0.218036856012343f, 0.547721213710874f, -0.0915514918588898f, -0.279344098401951f, -0.228654882218650f, 0.100432155997130f, 0.802024600677294f, 0.175832345686877f, 0.0551231013299744f, 0.938247319394824f, 0.639298571360036f, -0.291461603371678f, -0.853503115314794f, -0.604829242631156f, 0.0291571486740745f, -0.932575328418390f, -0.621235088415116f, 0.403040314052094f, -0.809695618266849f, 0.966605888732736f, -0.199254401023053,
-0.540808222970056f, -0.0141840769249790f, 0.114579158224093f, 0.466889318471371f, -0.145415211797766f, -0.846707387707480f, -0.881237200733915f, -0.410798723199712f, -0.637697860299854f, -0.196366036081372f, 0.193267531425712f, -0.258591200841940f, -0.173003722066551f, 0.478121376006132f, 0.953819951501542f, 0.969916001975448f, 0.131515861287576f, -0.499829658784781f, 0.320952777516193f, -0.226980682212371f, 0.766886115655233f, 0.647310434110803f, -0.772594685974992f, 0.772645949480187f, -0.936357605801364f, -0.671842916281206f, -0.595127074295355f, 0.335132581825520f, 0.648964430112689f, -0.793376819398441f, -0.963663232647360f, 0.914308824314478f, -0.397663128784982f, 0.803240040231588f, -0.291039120047626f, -0.339918835846510f, -0.208620988780609f, 0.278177231697424f, -0.833157746552451f, 0.260554706029473f, -0.580537744139231f, 0.918561093477862f, 0.641368468308093f, 0.827379039283645f, -0.412231303854834f, -0.518315486749742f, 0.423356687848085f, 0.0777277584993787f, 0.394127392657178f, 0.609705410002715f, 0.264669032561337f, -0.460555696512027f, -0.0858908123066196f, -0.281781559603429f, -0.179777723960362f, -0.00449990348855067f, 0.803703377739133f, -0.155074032314596f, -0.00206139428833696f, 0.0661730930565525f, -0.737509215752079f, 0.620182143819587f, 0.114750705414661f, 0.545663051433958f, 0.661601724477194f, -0.592280382351976f, 0.609240020031149f, -0.968781019917808f, -0.668068368389875f, 0.206915551463500f, 0.0951453192552747f, 0.268580107578401f, -0.0450052302342363f, -0.933589842483940f, 0.236570492858402f, 0.0688734168318912f, 0.930163232697303f, 0.435953476823146f, 0.533759385687075f, 0.368282038662015f, -0.602312961473778f, 0.709516631712345f, -0.168303926671961f, 0.130670870119294f, -0.657736111745007f, 0.115028598388756f, 0.173728026281032f, -0.681671363429886f, -0.538786035950873f, 0.481457671665448f, 0.0136795278434168f, -0.570065342244344f, 0.188187050857249f, -0.352869308173680f, -0.979175308628854f, 0.223702879460018f, 0.994220466087713f, -0.147795166105729f, 0.218427535879435f, -0.120050826084179f, -0.0124939247430063f, -0.645134875027126f, -0.503122688484778f, 0.534123007328982f, 0.619710972635444f, -0.234248243706177f, 0.987144458053815f, 0.261284702576427f, 0.851827092094236f, 0.750019654249059f, -0.926154630610335f, 0.449356103243440f, 0.783011320523296f, -0.459228158107270f, -0.228877816937867f, 0.271108937592868f, -0.676085611673506f, 0.783114428240160f, 0.636093784021493f, -0.754110314308629f, -0.546386104880684f, 0.0385811136139234f, -0.768951137117397f, -0.644624743947807f, 0.00890157035391148f, -0.0792572116273387f, -0.989980668770044f, 0.603057533157075f, 0.280835727469123f, -0.634716709420524f, -0.712669415138995f, -0.424129916157595f, -0.436923748487354f, 0.467366013559791f, 0.907740481011987f, 0.788617065944311f, -0.152237692069130f, -0.963044404518533f, 0.907393322909416f, 0.806867676446313f, 0.699270310021791f, 0.107867603776547f, 0.127360747415417f, -0.502645789696788f, -0.511744166872327f, -0.121672719343072f, -0.596527146770249f, 0.410180172377510f, -0.852889849908704f, 0.278972213674154f, 0.0260156356783650f, 0.997558501949683f, -0.499245840292893f, -0.451169267624132f, -0.881643497362337f, 0.986957209874262f, -0.129608292321380f, 0.935829016346258f, -0.649021465281634f, 0.550436689069794f, 0.278888743082679f, 0.0137769346664500f, -0.660666060213522f, -0.416709136728042f, -0.302903068397225f, 0.180657445835459f, -0.908195955986293f, 0.280056533234627f, -0.660025789034158f, -0.798207438952561f, 0.901575224780405f, -0.608702932295102f, 0.318860199910414f, 0.874005722023406f, -0.0816057579181704f, 0.981671341873017f, -0.339234700161323f, 0.559717959858931f, 0.390363525109105f, -0.309384476087470f, 0.956563156784297f, -0.623734354817613f, -0.196627375289105f, -0.702076014509088f, 0.293098766889643f, -0.617152224560368f, 0.859117491438645f, 0.661015739867647f, 0.0747554166353739f, -0.282417009682732f, -0.667461537762524f, -0.451029960388404f, -0.464518668674360f, 0.591389440503293f, 0.552648871601186f, -0.242406315814918f, 0.147876771864331f, -0.00605730052917419f, -0.850648363553678f, -0.659957159486993f, -0.165475362851332f, 0.204150315434812f, -0.665767311591476f, -0.716154682563576f, 0.417487456932076f, 0.448184990956287f, 0.733843802413198f, -0.170228277851921f, -0.346809954182150f, 0.956058632188011f, 0.0315623945930987f, 0.509027121691627f, -0.147826185909834f, 0.717423768198044f, -0.153258078639530f, -0.586190749016474f, 0.122228033051868f, -0.884999045468193f, -0.364729711773548f, 0.0869976154696972f, -0.793532199218799f, 0.533748273468951f, -0.852754376244435f, 0.294752047699830f, 0.136764278163013f, 0.838074791168389f, 0.795224598541123f, -0.778005568697498f, -0.260924769562304f, -0.303759147861313f, 0.273726011325558f, 0.530476779331216f, 0.0866801234357086f, 0.0677702376031544f, 0.724353404182035f, -0.974710312543683f, 0.791838170482991f, 0.247768259921660f, 0.979431048271259f, -0.386992541899814f, 0.0640038231299192f, -0.00457726816166693f, 0.371455553726539f, 0.647649995487707f, 0.268304945808406f, -0.320428608173924f, 0.0927511620029309f, 0.256010036486838f, 0.740396212690346f, -0.656873241472848f, 0.823534292439413f, -0.820380362458844f, -0.453300307443023f, 0.784238355222248f, 0.912791840124321f, 0.0999478035440859f, -0.212620916988855f, 0.0170290625008669f, -0.589062380565879f, -0.171833624145497f, -0.524918122866141f, 0.961528292650892f, 0.101262818636430f, 0.941455114569308f, -0.967226220138929f, 0.616781547648562f, -0.913823148383971f, 0.274508821885917f, 0.924653374107756f, -0.866302908989783f, 0.227541907715857f, 0.0907574361370582f, -0.127499097943315f, -0.942071371521895f, -0.119419163649152f, 0.674284088819523f, 0.881328505929745f, 0.246290207551702f, 0.0547607254148590f, -0.462882918359077f, 0.888969728230585f, 0.666583509571921f, 0.238417203582380f, -0.279842248122727f, 0.855260336845903f, 0.314306869401155f, -0.188654877893078f, -0.609304918228150f, 0.169453885325888f, 0.265617874907016f, -0.943423537926184f, 0.493118676869450f, -0.386147750024858f, 0.0103920154342951f, 0.753677832518483f, 0.363353012331066f, -0.286620106520429f, -0.623332994906295f, 0.183966714365642f, -0.124278942882867f, -0.687889346448110f, -0.509002319646341f, -0.705769785650865f, 0.600586126467172f, 0.814989294939922f, 0.198959025256652f, 0.477897007911356f, 0.757957814363899f, 0.617755921094230f, -0.353589871947529f, 0.419688673189503f, -0.860584865805600f, -0.0232779635193843f, -0.789951030889387f, -0.893196700185750f, 0.610996462535201f, 0.847373590985131f, -0.989553358501822f, -0.367651771428081f, 0.741563712056747f, -0.923595352848971f, -0.580174215739367f, 0.577092000574232f, -0.910872910110270f, -0.907499077314190f, 0.692372247654077f, 0.810694134592084f, -0.608596332548047f, 0.761254615051625f, 0.0546240611947364f, -0.393956427117691f, -0.116127831535139f, -0.0352014590913388f, 0.374742194768889f, -0.927344099730091f, 0.939301337232488f, -0.969831716293845f, -0.0489333404770240f, -0.586719398908953f, 0.0235541378462407f, 0.388882981728285f, -0.0728483242295113f, 0.418280445244943f, -0.574289337805456f, -0.779962057565259f, -0.835190719754123f, 0.918717316922657f, -0.765889988109173f, -0.935310664146932f, -0.0750906135370848f, -0.256246546197534f, 0.693865929543926f, 0.592800255527084f, 0.836743344551035f, -0.801953470827580f, 0.0595524153568945f, 0.158376549012192f, -0.429364776412726f, -0.450531184162532f, -0.169317185285268f, 0.420344570579195f, -0.902838087574441f, -0.654676904337469f, 0.941802178622893f, -0.411034608875500f, -0.455381371659872f, 0.582371240315256f, -0.276150504466756f, 0.164276403376185f, -0.960238817086774f, 0.590055303394028f, -0.995185688656226f, -0.285809748360467f, -0.792066171752882f, -0.456123303649101f, -0.864169187700384f, 0.798745251308383f, -0.517673464079948f, 0.523086536900369f, 0.398784615211052f, 0.908677185333852f, -0.434846969584770f, -0.277024535706464f, 0.575800013122065f, -0.0423952171673019f, -0.327530749916683f, -0.401220909875065f, -0.232577533032385f, 0.577630268254944f, -0.733290201484409f, -0.297499739456838f, 0.166541885572822f, -0.646828619904039f, 0.0312662656272755f, 0.754145050600965f, -0.908499825108811f, 0.315379190361296f, 0.366242661082351f, 0.867903806940678f, -0.613391940567782f, 0.00760147209048068f, 0.953424134034927f, -0.812551125910811f, 0.734998935207065f, 0.781720854678504f, -0.653974423413561f, 0.612587888218526f, -0.297359914095386f, -0.409559158758694f, -0.143962230212734f, -0.814888102841114f, 0.359131810502055f, 0.356924557741016f, -0.872415989401612f, 0.716849887848809f, -0.374916928585818f, -0.0702264435280595f, 0.329843438660215f, 0.0956097573088677f, -0.937528128860310f, -0.322293489817529f, 0.781444964993177f, -0.810141738751828f, -0.150295079242497f, 0.846909181293597f, -0.128124277517711f, -0.752611695817661f, 0.839996835828451f, -0.0705685941510277f, 0.000366462394740585f, 0.0788016995849923f, -0.246053200655556f, -0.156645099915028f, -0.460752333796863f, 0.622021359864204f, 0.722871957583123f, -0.257873353238499f, -0.309810184480446f, 0.765248644407833f, -0.553316047243663f, -0.612742789838491f, 0.354017349601509f, 0.923293368553697f, 0.630695912377860f, -0.148750121613537f, -0.821801680234240f, 0.368247966228196f, 0.405416044101496f, -0.803232509711354f, -0.429778551911399f, -0.723837414527446f, -0.963925147452133f, 0.190882872226757f, 0.477008077263598f, -0.661282403679070f, 0.271643442525556f, -0.915994079618801f, 0.196564556546175f, 0.378359035245796f, 0.584016730657668f, -0.0377864332655202f, -0.327376192853106f, 0.850744189707984f, 0.799571679043808f, -0.111126908452029f, 0.525587242291601f, -0.404486180733535f, -0.134496922397279f, 0.0890128096708100f, -0.815560643303157f, -0.920166023598312f, -0.360079578314899f, -0.556238898466371f, -0.220978103133838f, -0.571530268052405f, 0.573332217175226f, -0.133862258696460f, -0.982130330352248f, -0.352538465285082f, 0.318683937697894f, -0.790927430842686f, 0.691168535237102f, 0.806014327242002f, -0.981639450008060f, 0.407200095027265f, 0.918249921845949f, 0.776880149695420f, -0.437773083955269f, -0.385117533333437f, 0.0115152415796460f, 0.687224538003991f, 0.992524870612626f, 0.471003324792228f, -0.873541777412034f, -0.560923118634380f, -0.726151823613842f, -0.538941951730010f, 0.772057551475325f, 0.858490725829641f, -0.168849338472479f };
# 102 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
fxp_t wrap(fxp_t kX, fxp_t kLowerBound, fxp_t kUpperBound)
{
int32_t range_size = kUpperBound - kLowerBound + 1;
if (kX < kLowerBound){
kX += range_size * ((kLowerBound - kX) / range_size + 1);
}
return kLowerBound + (kX - kLowerBound) % range_size;
}
fxp_t fxp_get_int_part(fxp_t in) {
return ((in < 0) ? -((-in) & _fxp_imask) : in & _fxp_imask);
}
fxp_t fxp_get_frac_part(fxp_t in) {
return ((in < 0) ? -((-in) & _fxp_fmask) : in & _fxp_fmask);
}
float fxp_to_float(fxp_t fxp);
fxp_t fxp_quantize(fxp_t aquant) {
if (overflow_mode == 2) {
if(aquant < _fxp_min) {
return _fxp_min;
}
else if(aquant > _fxp_max) {
return _fxp_max;
}
}
else if (overflow_mode == 3) {
if(aquant < _fxp_min || aquant > _fxp_max) {
return wrap(aquant, _fxp_min, _fxp_max);
}
}
return (fxp_t) aquant;
}
void fxp_verify_overflow(fxp_t value){
fxp_quantize(value);
printf("An Overflow Occurred in system's output");
__DSVERIFIER_assert(value <= _fxp_max && value >= _fxp_min);
}
void fxp_verify_overflow_node(fxp_t value, char* msg){
if (2 == 2)
{
printf("%s",msg);
__DSVERIFIER_assert(value <= _fxp_max && value >= _fxp_min);
}
}
void fxp_verify_overflow_array(fxp_t array[], int n){
int i=0;
for(i=0; i<n;i++){
fxp_verify_overflow(array[i]);
}
}
fxp_t fxp_int_to_fxp(int in) {
fxp_t lin;
lin = (fxp_t) in*_fxp_one;
return lin;
}
int fxp_to_int(fxp_t fxp) {
if(fxp >= 0){
fxp += _fxp_half;
} else {
fxp -= _fxp_half;
}
fxp >>= impl.frac_bits;
return (int) fxp;
}
fxp_t fxp_float_to_fxp(float f) {
fxp_t tmp;
double ftemp;
ftemp = f * scale_factor[impl.frac_bits];
if(f >= 0) {
tmp = (fxp_t)(ftemp + 0.5);
}
else {
tmp = (fxp_t)(ftemp - 0.5);
}
return tmp;
}
fxp_t fxp_double_to_fxp(double value) {
fxp_t tmp;
double ftemp = value * scale_factor[impl.frac_bits];
if (rounding_mode == 0){
if(value >= 0) {
tmp = (fxp_t)(ftemp + 0.5);
}
else {
tmp = (fxp_t)(ftemp - 0.5);
}
} else if(rounding_mode == 1){
tmp = (fxp_t) ftemp;
double residue = ftemp - tmp;
if ((value < 0) && (residue != 0)){
ftemp = ftemp - 1;
tmp = (fxp_t) ftemp;
}
} else if (rounding_mode == 0){
tmp = (fxp_t) ftemp;
}
return tmp;
}
void fxp_float_to_fxp_array(float f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
r[i] = fxp_float_to_fxp(f[i]);
}
}
void fxp_double_to_fxp_array(double f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
r[i] = fxp_double_to_fxp(f[i]);
}
}
# 275 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
float fxp_to_float(fxp_t fxp) {
float f;
int f_int = (int) fxp;
f = f_int * scale_factor_inv[impl.frac_bits];
return f;
}
double fxp_to_double(fxp_t fxp) {
double f;
int f_int = (int) fxp;
f = f_int * scale_factor_inv[impl.frac_bits];
return f;
}
void fxp_to_float_array(float f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
f[i] = fxp_to_float(r[i]);
}
}
void fxp_to_double_array(double f[], fxp_t r[], int N) {
int i;
for(i = 0; i < N; ++i) {
f[i] = fxp_to_double(r[i]);
}
}
fxp_t fxp_abs(fxp_t a) {
fxp_t tmp;
tmp = ((a < 0) ? -(fxp_t)(a) : a);
tmp = fxp_quantize(tmp);
return tmp;
}
fxp_t fxp_add(fxp_t aadd, fxp_t badd) {
fxp_t tmpadd;
tmpadd = ((fxp_t)(aadd) + (fxp_t)(badd));
tmpadd = fxp_quantize(tmpadd);
return tmpadd;
}
fxp_t fxp_sub(fxp_t asub, fxp_t bsub) {
fxp_t tmpsub;
tmpsub = (fxp_t)((fxp_t)(asub) - (fxp_t)(bsub));
tmpsub = fxp_quantize(tmpsub);
return tmpsub;
}
fxp_t fxp_mult(fxp_t amult, fxp_t bmult) {
fxp_t tmpmult, tmpmultprec;
tmpmult = (fxp_t)((fxp_t)(amult)*(fxp_t)(bmult));
if (tmpmult >= 0) {
tmpmultprec = (tmpmult + ((tmpmult & 1 << (impl.frac_bits - 1)) << 1)) >> impl.frac_bits;
} else {
tmpmultprec = -(((-tmpmult) + (((-tmpmult) & 1 << (impl.frac_bits - 1)) << 1)) >> impl.frac_bits);
}
tmpmultprec = fxp_quantize(tmpmultprec);
return tmpmultprec;
}
# 372 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
fxp_t fxp_div(fxp_t a, fxp_t b){
__DSVERIFIER_assume( b!=0 );
fxp_t tmpdiv = ((a << impl.frac_bits) / b);
tmpdiv = fxp_quantize(tmpdiv);
return tmpdiv;
}
fxp_t fxp_neg(fxp_t aneg) {
fxp_t tmpneg;
tmpneg = -(fxp_t)(aneg);
tmpneg = fxp_quantize(tmpneg);
return tmpneg;
}
# 398 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/fixed-point.h"
fxp_t fxp_sign(fxp_t a) {
return ((a == 0) ? 0 : ((a < 0) ? _fxp_minus_one : _fxp_one) );
}
fxp_t fxp_shrl(fxp_t in, int shift) {
return (fxp_t) (((unsigned int) in) >> shift);
}
fxp_t fxp_square(fxp_t a) {
return fxp_mult(a, a);
}
void fxp_print_int(fxp_t a) {
printf("\n%i", (int32_t)a);
}
void fxp_print_float(fxp_t a) {
printf("\n%f", fxp_to_float(a));
}
void fxp_print_float_array(fxp_t a[], int N) {
int i;
for(i = 0; i < N; ++i) {
printf("\n%f", fxp_to_float(a[i]));
}
}
void print_fxp_array_elements(char * name, fxp_t * v, int n){
printf("%s = {", name);
int i;
for(i=0; i < n; i++){
printf(" %jd ", v[i]);
}
printf("}\n");
}
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 1
# 24 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
void initialize_array(double v[], int n){
int i;
for(i=0; i<n; i++){
v[i] = 0;
}
}
void revert_array(double v[], double out[], int n){
initialize_array(out,n);
int i;
for(i=0; i<n; i++){
out[i] = v[n-i-1];
}
}
double internal_pow(double a, double b){
int i;
double acc = 1;
for (i=0; i < b; i++){
acc = acc*a;
}
return acc;
}
double internal_abs(double a){
return a < 0 ? -a : a;
}
int fatorial(int n){
return n == 0 ? 1 : n * fatorial(n-1);
}
int check_stability(double a[], int n){
int lines = 2 * n - 1;
int columns = n;
double m[lines][n];
int i,j;
double current_stability[n];
for (i=0; i < n; i++){
current_stability[i] = a[i];
}
double sum = 0;
for (i=0; i < n; i++){
sum += a[i];
}
if (sum <= 0){
printf("[DEBUG] the first constraint of Jury criteria failed: (F(1) > 0)");
return 0;
}
sum = 0;
for (i=0; i < n; i++){
sum += a[i] * internal_pow(-1, n-1-i);
}
sum = sum * internal_pow(-1, n-1);
if (sum <= 0){
printf("[DEBUG] the second constraint of Jury criteria failed: (F(-1)*(-1)^n > 0)");
return 0;
}
if (internal_abs(a[n-1]) > a[0]){
printf("[DEBUG] the third constraint of Jury criteria failed: (abs(a0) < a_{n}*z^{n})");
return 0;
}
for (i=0; i < lines; i++){
for (j=0; j < columns; j++){
m[i][j] = 0;
}
}
for (i=0; i < lines; i++){
for (j=0; j < columns; j++){
if (i == 0){
m[i][j] = a[j];
continue;
}
if (i % 2 != 0 ){
int x;
for(x=0; x<columns;x++){
m[i][x] = m[i-1][columns-x-1];
}
columns = columns - 1;
j = columns;
}else{
m[i][j] = m[i-2][j] - (m[i-2][columns] / m[i-2][0]) * m[i-1][j];
}
}
}
int first_is_positive = m[0][0] >= 0 ? 1 : 0;
for (i=0; i < lines; i++){
if (i % 2 == 0){
int line_is_positive = m[i][0] >= 0 ? 1 : 0;
if (first_is_positive != line_is_positive){
return 0;
}
continue;
}
}
return 1;
}
void poly_sum(double a[], int Na, double b[], int Nb, double ans[], int Nans){
int i;
Nans = Na>Nb? Na:Nb;
for (i=0; i<Nans; i++){
if (Na>Nb){
ans[i]=a[i];
if (i > Na-Nb-1){
ans[i]=ans[i]+b[i-Na+Nb];
}
}else {
ans[i]=b[i];
if (i> Nb - Na -1){
ans[i]=ans[i]+a[i-Nb+Na];
}
}
}
}
void poly_mult(double a[], int Na, double b[], int Nb, double ans[], int Nans){
int i;
int j;
int k;
Nans = Na+Nb-1;
for (i=0; i<Na; i++){
for (j=0; j<Nb; j++){
k= Na + Nb - i - j - 2;
ans[k]=0;
}
}
for (i=0; i<Na; i++){
for (j=0; j<Nb; j++){
k= Na + Nb - i - j - 2;
ans[k]=ans[k]+a[Na - i - 1]*b[Nb - j - 1];
}
}
}
void double_check_oscillations(double * y, int y_size){
__DSVERIFIER_assume(y[0] != y[y_size - 1]);
int window_timer = 0;
int window_count = 0;
int i, j;
for (i = 2; i < y_size; i++){
int window_size = i;
for(j=0; j<y_size; j++){
if (window_timer > window_size){
window_timer = 0;
window_count = 0;
}
int window_index = j + window_size;
if (window_index < y_size){
if (y[j] == y[window_index]){
window_count++;
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
((void) sizeof ((
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
!(window_count == window_size)
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
!(window_count == window_size)
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
) ; else __assert_fail (
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
"!(window_count == window_size)"
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h", 209, __extension__ __PRETTY_FUNCTION__); }))
# 209 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/util.h"
;
}
}else{
break;
}
window_timer++;
}
}
}
void double_check_limit_cycle(double * y, int y_size){
double reference = y[y_size - 1];
int idx = 0;
int window_size = 1;
for(idx = (y_size-2); idx >= 0; idx--){
if (y[idx] != reference){
window_size++;
}else{
break;
}
}
__DSVERIFIER_assume(window_size != y_size && window_size != 1);
printf("window_size %d\n", window_size);
int desired_elements = 2 * window_size;
int found_elements = 0;
for(idx = (y_size-1); idx >= 0; idx--){
if (idx > (y_size-window_size-1)){
printf("%.0f == %.0f\n", y[idx], y[idx-window_size]);
int cmp_idx = idx - window_size;
if ((cmp_idx > 0) && (y[idx] == y[idx-window_size])){
found_elements = found_elements + 2;
}else{
break;
}
}
}
printf("desired_elements %d\n", desired_elements);
printf("found_elements %d\n", found_elements);
__DSVERIFIER_assert(desired_elements != found_elements);
}
void double_check_persistent_limit_cycle(double * y, int y_size){
int idy = 0;
int count_same = 0;
int window_size = 0;
double reference = y[0];
for(idy = 0; idy < y_size; idy++){
if (y[idy] != reference){
window_size++;
} else if (window_size != 0){
break;
} else {
count_same++;
}
}
window_size += count_same;
__DSVERIFIER_assume(window_size > 1 && window_size <= y_size/2);
double lco_elements[window_size];
for(idy = 0; idy < y_size; idy++){
if (idy < window_size){
lco_elements[idy] = y[idy];
}
}
idy = 0;
int lco_idy = 0;
_Bool is_persistent = 0;
while (idy < y_size){
if(y[idy++] == lco_elements[lco_idy++]){
is_persistent = 1;
}else{
is_persistent = 0;
break;
}
if (lco_idy == window_size){
lco_idy = 0;
}
}
__DSVERIFIER_assert(is_persistent == 0);
}
void print_array_elements(char * name, double * v, int n){
printf("%s = {", name);
int i;
for(i=0; i < n; i++){
printf(" %.32f ", v[i]);
}
printf("}\n");
}
void double_add_matrix( unsigned int lines, unsigned int columns, double m1[4][4], double m2[4][4], double result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
result[i][j] = m1[i][j] + m2[i][j];
}
}
}
void double_sub_matrix( unsigned int lines, unsigned int columns, double m1[4][4], double m2[4][4], double result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
result[i][j] = m1[i][j] - m2[i][j];
}
}
}
void double_matrix_multiplication( unsigned int i1, unsigned int j1, unsigned int i2, unsigned int j2, double m1[4][4], double m2[4][4], double m3[4][4]){
unsigned int i, j, k;
if (j1 == i2) {
for (i=0; i<i1; i++) {
for (j=0; j<j2; j++) {
m3[i][j] = 0;
}
}
for (i=0;i<i1; i++) {
for (j=0; j<j2; j++) {
for (k=0; k<j1; k++) {
double mult = (m1[i][k] * m2[k][j]);
m3[i][j] = m3[i][j] + (m1[i][k] * m2[k][j]);
}
}
}
} else {
printf("\nError! Operation invalid, please enter with valid matrices.\n");
}
}
void fxp_matrix_multiplication( unsigned int i1, unsigned int j1, unsigned int i2, unsigned int j2, fxp_t m1[4][4], fxp_t m2[4][4], fxp_t m3[4][4]){
unsigned int i, j, k;
if (j1 == i2) {
for (i=0; i<i1; i++) {
for (j=0; j<j2; j++) {
m3[i][j] = 0;
}
}
for (i=0;i<i1; i++) {
for (j=0; j<j2; j++) {
for (k=0; k<j1; k++) {
m3[i][j] = fxp_add( m3[i][j], fxp_mult(m1[i][k] , m2[k][j]));
}
}
}
} else {
printf("\nError! Operation invalid, please enter with valid matrices.\n");
}
}
void fxp_exp_matrix(unsigned int lines, unsigned int columns, fxp_t m1[4][4], unsigned int expNumber, fxp_t result[4][4]){
unsigned int i, j, l, k;
fxp_t m2[4][4];
if(expNumber == 0){
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
if(i == j){
result[i][j] = fxp_double_to_fxp(1.0);
} else {
result[i][j] = 0.0;
}
}
}
return;
}
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = m1[i][j];
if(expNumber == 1){
return;
}
for(l = 1; l < expNumber; l++){
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) m2[i][j] = result[i][j];
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = 0;
for (i=0;i<lines; i++) {
for (j=0; j<columns; j++) {
for (k=0; k<columns; k++) {
result[i][j] = fxp_add( result[i][j], fxp_mult(m2[i][k] , m1[k][j]));
}
}
}
}
}
void double_exp_matrix(unsigned int lines, unsigned int columns, double m1[4][4], unsigned int expNumber, double result[4][4]){
unsigned int i, j, k, l;
double m2[4][4];
if(expNumber == 0){
for (i = 0; i < lines; i++){
for (j = 0; j < columns; j++){
if(i == j){
result[i][j] = 1.0;
} else {
result[i][j] = 0.0;
}
}
}
return;
}
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = m1[i][j];
if(expNumber == 1){
return;
}
for(l = 1; l < expNumber; l++){
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) m2[i][j] = result[i][j];
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = 0;
for (i=0;i<lines; i++) {
for (j=0; j<columns; j++) {
for (k=0; k<columns; k++) {
result[i][j] = result[i][j] + (m2[i][k] * m1[k][j]);
}
}
}
}
}
void fxp_add_matrix( unsigned int lines, unsigned int columns, fxp_t m1[4][4], fxp_t m2[4][4], fxp_t result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) {
result[i][j] = fxp_add(m1[i][j] , m2[i][j]);
}
}
void fxp_sub_matrix( unsigned int lines, unsigned int columns, fxp_t m1[4][4], fxp_t m2[4][4], fxp_t result[4][4]){
unsigned int i, j;
for (i = 0; i < lines; i++)
for (j = 0; j < columns; j++) result[i][j] = fxp_sub(m1[i][j] , m2[i][j]);
}
void print_matrix(double matrix[4][4], unsigned int lines, unsigned int columns){
printf("\nMatrix\n=====================\n\n");
unsigned int i, j;
for (i=0; i<lines; i++) {
for (j=0; j<columns; j++) {
printf("#matrix[%d][%d]: %2.2f ", i,j,matrix[i][j]);
}
printf("\n");
}
printf("\n");
}
double determinant(double a[4][4],int n)
{
int i,j,j1,j2;
double det = 0;
double m[4][4];
if (n < 1) {
} else if (n == 1) {
det = a[0][0];
} else if (n == 2) {
det = a[0][0] * a[1][1] - a[1][0] * a[0][1];
} else {
det = 0;
for (j1=0;j1<n;j1++) {
for (i=0;i<n-1;i++)
for (i=1;i<n;i++) {
j2 = 0;
for (j=0;j<n;j++) {
if (j == j1)
continue;
m[i-1][j2] = a[i][j];
j2++;
}
}
det += internal_pow(-1.0,1.0+j1+1.0) * a[0][j1] * determinant(m,n-1);
}
}
return(det);
}
double fxp_determinant(fxp_t a_fxp[4][4],int n)
{
int i,j,j1,j2;
double a[4][4];
for(i=0; i<n;i++){
for(j=0; j<n;j++){
a[i][j]= fxp_to_double(a_fxp[i][j]);
}
}
double det = 0;
double m[4][4];
if (n < 1) {
} else if (n == 1) {
det = a[0][0];
} else if (n == 2) {
det = a[0][0] * a[1][1] - a[1][0] * a[0][1];
} else {
det = 0;
for (j1=0;j1<n;j1++) {
for (i=0;i<n-1;i++)
for (i=1;i<n;i++) {
j2 = 0;
for (j=0;j<n;j++) {
if (j == j1)
continue;
m[i-1][j2] = a[i][j];
j2++;
}
}
det += internal_pow(-1.0,1.0+j1+1.0) * a[0][j1] * determinant(m,n-1);
}
}
return(det);
}
void transpose(double a[4][4], double b[4][4],int n, int m)
{
int i,j;
for (i=0;i<n;i++) {
for (j=0;j<m;j++) {
b[j][i] = a[i][j];
}
}
}
void fxp_transpose(fxp_t a[4][4], fxp_t b[4][4],int n, int m)
{
int i,j;
for (i=0;i<n;i++) {
for (j=0;j<m;j++) {
b[j][i] = a[i][j];
}
}
}
# 24 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
extern int generic_timer;
extern hardware hw;
double generic_timing_shift_l_double(double zIn, double z[], int N) {
generic_timer += ((2 * hw.assembly.push) + (3 * hw.assembly.in) + (3 * hw.assembly.out) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli) + (8 * hw.assembly.std));
int i;
double zOut;
zOut = z[0];
generic_timer += ((5 * hw.assembly.ldd) + (2 * hw.assembly.mov) + (4 * hw.assembly.std) + (1 * hw.assembly.ld));
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (i = 0; i < N - 1; i++) {
generic_timer += ((17 * hw.assembly.ldd) + (4 * hw.assembly.lsl) + (4 * hw.assembly.rol) + (2 * hw.assembly.add) + (2 * hw.assembly.adc) + (6 * hw.assembly.mov) + (2 * hw.assembly.adiw) + (5 * hw.assembly.std) + (1 * hw.assembly.ld) + (1 * hw.assembly.st) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbc)+ (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brlt));
z[i] = z[i + 1];
}
z[N - 1] = zIn;
generic_timer += ((12 * hw.assembly.ldd) + (6 * hw.assembly.mov) + (3 * hw.assembly.std) + (2 * hw.assembly.lsl) + (2 * hw.assembly.rol) + (1 * hw.assembly.adc) + (1 * hw.assembly.add) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.st) + (1 * hw.assembly.adiw) + (1 * hw.assembly.in)+ (1 * hw.assembly.cli));
generic_timer += ((3 * hw.assembly.out) + (2 * hw.assembly.pop) + (1 * hw.assembly.ret));
return (zOut);
}
double generic_timing_shift_r_double(double zIn, double z[], int N) {
generic_timer += ((2 * hw.assembly.push) + (3 * hw.assembly.in) + (3 * hw.assembly.out) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli) + (8 * hw.assembly.std));
int i;
double zOut;
zOut = z[N - 1];
generic_timer += ((7 * hw.assembly.ldd) + (2 * hw.assembly.rol) + (2 * hw.assembly.lsl) + (2 * hw.assembly.mov) + (4 * hw.assembly.std) + (1 * hw.assembly.add) + (1 * hw.assembly.adc) + (1 * hw.assembly.ld) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci));
generic_timer += ((2 * hw.assembly.ldd) + (2 * hw.assembly.std) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.rjmp));
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
generic_timer += ((15 * hw.assembly.ldd) + (4 * hw.assembly.lsl) + (4 * hw.assembly.rol) + (2 * hw.assembly.add) + (2 * hw.assembly.adc) + (4 * hw.assembly.mov) + (5 * hw.assembly.std) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.ld) + (1 * hw.assembly.st) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brlt));
}
z[0] = zIn;
generic_timer += ((10 * hw.assembly.ldd) + (5 * hw.assembly.mov) + (3 * hw.assembly.std) + (3 * hw.assembly.out) + (2 * hw.assembly.pop) + (1 * hw.assembly.ret) + (1 * hw.assembly.ret) + (1 * hw.assembly.cli) + (1 * hw.assembly.in) + (1 * hw.assembly.st) + (1 * hw.assembly.adiw));
return zOut;
}
fxp_t shiftL(fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
fxp_t shiftR(fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
zOut = z[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
}
z[0] = zIn;
return zOut;
}
float shiftLfloat(float zIn, float z[], int N) {
int i;
float zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
float shiftRfloat(float zIn, float z[], int N) {
int i;
float zOut;
zOut = z[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
}
z[0] = zIn;
return zOut;
}
double shiftRDdouble(double zIn, double z[], int N) {
int i;
double zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
double shiftRdouble(double zIn, double z[], int N) {
int i;
double zOut;
zOut = z[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
}
z[0] = zIn;
return zOut;
}
double shiftLDouble(double zIn, double z[], int N) {
int i;
double zOut;
zOut = z[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
}
z[N - 1] = zIn;
return (zOut);
}
void shiftLboth(float zfIn, float zf[], fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
float zfOut;
zOut = z[0];
zfOut = zf[0];
for (i = 0; i < N - 1; i++) {
z[i] = z[i + 1];
zf[i] = zf[i + 1];
}
z[N - 1] = zIn;
zf[N - 1] = zfIn;
}
void shiftRboth(float zfIn, float zf[], fxp_t zIn, fxp_t z[], int N) {
int i;
fxp_t zOut;
float zfOut;
zOut = z[N - 1];
zfOut = zf[N - 1];
for (i = N - 1; i > 0; i--) {
z[i] = z[i - 1];
zf[i] = zf[i - 1];
}
z[0] = zIn;
zf[0] = zfIn;
}
int order(int Na, int Nb) {
return Na > Nb ? Na - 1 : Nb - 1;
}
void fxp_check_limit_cycle(fxp_t y[], int y_size){
fxp_t reference = y[y_size - 1];
int idx = 0;
int window_size = 1;
for(idx = (y_size-2); idx >= 0; idx--){
if (y[idx] != reference){
window_size++;
}else{
break;
}
}
__DSVERIFIER_assume(window_size != y_size && window_size != 1);
printf("window_size %d\n", window_size);
int desired_elements = 2 * window_size;
int found_elements = 0;
for(idx = (y_size-1); idx >= 0; idx--){
if (idx > (y_size-window_size-1)){
printf("%.0f == %.0f\n", y[idx], y[idx-window_size]);
int cmp_idx = idx - window_size;
if ((cmp_idx > 0) && (y[idx] == y[idx-window_size])){
found_elements = found_elements + 2;
}else{
break;
}
}
}
__DSVERIFIER_assume(found_elements > 0);
printf("desired_elements %d\n", desired_elements);
printf("found_elements %d\n", found_elements);
__DSVERIFIER_assume(found_elements == desired_elements);
__DSVERIFIER_assert(0);
}
void fxp_check_persistent_limit_cycle(fxp_t * y, int y_size){
int idy = 0;
int count_same = 0;
int window_size = 0;
fxp_t reference = y[0];
for(idy = 0; idy < y_size; idy++){
if (y[idy] != reference){
window_size++;
} else if (window_size != 0){
break;
} else {
count_same++;
}
}
window_size += count_same;
__DSVERIFIER_assume(window_size > 1 && window_size <= y_size/2);
fxp_t lco_elements[window_size];
for(idy = 0; idy < y_size; idy++){
if (idy < window_size){
lco_elements[idy] = y[idy];
}
}
idy = 0;
int lco_idy = 0;
_Bool is_persistent = 0;
while (idy < y_size){
if(y[idy++] == lco_elements[lco_idy++]){
is_persistent = 1;
}else{
is_persistent = 0;
break;
}
if (lco_idy == window_size){
lco_idy = 0;
}
}
__DSVERIFIER_assert(is_persistent == 0);
}
void fxp_check_oscillations(fxp_t y[] , int y_size){
__DSVERIFIER_assume((y[0] != y[y_size - 1]) && (y[y_size - 1] != y[y_size - 2]));
int window_timer = 0;
int window_count = 0;
int i, j;
for (i = 2; i < y_size; i++){
int window_size = i;
for(j=0; j<y_size; j++){
if (window_timer > window_size){
window_timer = 0;
window_count = 0;
}
int window_index = j + window_size;
if (window_index < y_size){
if (y[j] == y[window_index]){
window_count++;
__DSVERIFIER_assert(!(window_count == window_size));
}
}else{
break;
}
window_timer++;
}
}
}
int fxp_ln(int x) {
int t, y;
y = 0xa65af;
if (x < 0x00008000)
x <<= 16, y -= 0xb1721;
if (x < 0x00800000)
x <<= 8, y -= 0x58b91;
if (x < 0x08000000)
x <<= 4, y -= 0x2c5c8;
if (x < 0x20000000)
x <<= 2, y -= 0x162e4;
if (x < 0x40000000)
x <<= 1, y -= 0x0b172;
t = x + (x >> 1);
if ((t & 0x80000000) == 0)
x = t, y -= 0x067cd;
t = x + (x >> 2);
if ((t & 0x80000000) == 0)
x = t, y -= 0x03920;
t = x + (x >> 3);
if ((t & 0x80000000) == 0)
x = t, y -= 0x01e27;
t = x + (x >> 4);
if ((t & 0x80000000) == 0)
x = t, y -= 0x00f85;
t = x + (x >> 5);
if ((t & 0x80000000) == 0)
x = t, y -= 0x007e1;
t = x + (x >> 6);
if ((t & 0x80000000) == 0)
x = t, y -= 0x003f8;
t = x + (x >> 7);
if ((t & 0x80000000) == 0)
x = t, y -= 0x001fe;
x = 0x80000000 - x;
y -= x >> 15;
return y;
}
double fxp_log10_low(double x) {
int xint = (int) (x * 65536.0 + 0.5);
int lnum = fxp_ln(xint);
int lden = fxp_ln(655360);
return ((double) lnum / (double) lden);
}
double fxp_log10(double x) {
if (x > 32767.0) {
if (x > 1073676289.0) {
x = x / 1073676289.0;
return fxp_log10_low(x) + 9.030873362;
}
x = x / 32767.0;
return fxp_log10_low(x) + 4.515436681;
}
return fxp_log10_low(x);
}
float snrVariance(float s[], float n[], int blksz) {
int i;
double sm = 0, nm = 0, sv = 0, nv = 0, snr;
for (i = 0; i < blksz; i++) {
sm += s[i];
nm += n[i];
}
sm /= blksz;
nm /= blksz;
for (i = 0; i < blksz; i++) {
sv += (s[i] - sm) * (s[i] - sm);
nv += (n[i] - nm) * (n[i] - nm);
}
if (nv != 0.0f) {
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"sv >= nv"
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 373, __extension__ __PRETTY_FUNCTION__); }))
# 373 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
snr = sv / nv;
return snr;
} else {
return 9999.9f;
}
}
float snrPower(float s[], float n[], int blksz) {
int i;
double sv = 0, nv = 0, snr;
for (i = 0; i < blksz; i++) {
sv += s[i] * s[i];
nv += n[i] * n[i];
}
if (nv != 0.0f) {
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
sv >= nv
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"sv >= nv"
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 394, __extension__ __PRETTY_FUNCTION__); }))
# 394 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
snr = sv / nv;
return snr;
} else {
return 9999.9f;
}
}
float snrPoint(float s[], float n[], int blksz) {
int i;
double ratio = 0, power = 0;
for (i = 0; i < blksz; i++) {
if(n[i] == 0) continue;
ratio = s[i] / n[i];
if(ratio > 150.0f || ratio < -150.0f) continue;
power = ratio * ratio;
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
power >= 1.0f
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
power >= 1.0f
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"power >= 1.0f"
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 412, __extension__ __PRETTY_FUNCTION__); }))
# 412 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
}
return 9999.9f;
}
unsigned long next = 1;
int rand(void)
{
next = next*1103515245 + 12345;
return (unsigned int)(next/65536) % 32768;
}
void srand(unsigned int seed)
{
next = seed;
}
float iirIIOutTime(float w[], float x, float a[], float b[], int Na, int Nb) {
int timer1 = 0;
float *a_ptr, *b_ptr, *w_ptr;
float sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
timer1 += 71;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
timer1 += 54;
}
w[0] += x;
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
timer1 += 46;
}
timer1 += 38;
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"(double)timer1*CYCLE <= (double)DEADLINE"
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 450, __extension__ __PRETTY_FUNCTION__); }))
# 450 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
return sum;
}
float iirIItOutTime(float w[], float x, float a[], float b[], int Na, int Nb) {
int timer1 = 0;
float *a_ptr, *b_ptr;
float yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
timer1 += 105;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
timer1 += 41;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
timer1 += 38;
}
timer1 += 54;
}
timer1 += 7;
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"(double)timer1*CYCLE <= (double)DEADLINE"
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 477, __extension__ __PRETTY_FUNCTION__); }))
# 477 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
return yout;
}
double iirIItOutTime_double(double w[], double x, double a[], double b[], int Na, int Nb) {
int timer1 = 0;
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
timer1 += 105;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
timer1 += 41;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
timer1 += 38;
}
timer1 += 54;
}
timer1 += 7;
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
((void) sizeof ((
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
(double)timer1*1 / 16000000 <= (double)1 / 100
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
) ; else __assert_fail (
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
"(double)timer1*CYCLE <= (double)DEADLINE"
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h", 504, __extension__ __PRETTY_FUNCTION__); }))
# 504 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/functions.h"
;
return yout;
}
void iirOutBoth(float yf[], float xf[], float af[], float bf[], float *sumf_ref,
fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], fxp_t *sum_ref, int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
float *af_ptr, *yf_ptr, *bf_ptr, *xf_ptr;
fxp_t sum = 0;
float sumf = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
af_ptr = &af[1];
yf_ptr = &yf[Na - 1];
bf_ptr = &bf[0];
xf_ptr = &xf[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum = fxp_add(sum, fxp_mult(*b_ptr++, *x_ptr--));
sumf += *bf_ptr++ * *xf_ptr--;
}
for (j = 1; j < Na; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr++, *y_ptr--));
sumf -= *af_ptr++ * *yf_ptr--;
}
*sum_ref = sum;
*sumf_ref = sumf;
}
fxp_t iirOutFixedL(fxp_t y[], fxp_t x[], fxp_t xin, fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
int i, j;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
}
x[Nb - 1] = xin;
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
for (j = 1; j < Na - 1; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[j] = y[j+1];
}
if(Na>1) sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[Na - 1] = sum;
return sum;
}
float iirOutFloatL(float y[], float x[], float xin, float a[], float b[], int Na, int Nb) {
float *a_ptr, *y_ptr, *b_ptr, *x_ptr;
float sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
int i, j;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum += *b_ptr-- * *x_ptr++;
}
x[Nb - 1] = xin;
sum += *b_ptr-- * *x_ptr++;
for (j = 1; j < Na - 1; j++) {
sum -= *a_ptr-- * *y_ptr++;
y[j] = y[j+1];
}
if(Na>1) sum -= *a_ptr-- * *y_ptr++;
y[Na - 1] = sum;
return sum;
}
float iirOutBothL(float yf[], float xf[], float af[], float bf[], float xfin,
fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], fxp_t xin, int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
float *af_ptr, *yf_ptr, *bf_ptr, *xf_ptr;
float sumf = 0;
af_ptr = &af[Na - 1];
yf_ptr = &yf[1];
bf_ptr = &bf[Nb - 1];
xf_ptr = &xf[0];
int i, j;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
xf[i] = xf[i+1];
sumf += *bf_ptr-- * *xf_ptr++;
}
x[Nb - 1] = xin;
sum = fxp_add(sum, fxp_mult(*b_ptr--, *x_ptr++));
xf[Nb - 1] = xfin;
sumf += *bf_ptr-- * *xf_ptr++;
for (j = 1; j < Na - 1; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[j] = y[j+1];
sumf -= *af_ptr-- * *yf_ptr++;
yf[j] = yf[j+1];
}
if(Na>1) sum = fxp_sub(sum, fxp_mult(*a_ptr--, *y_ptr++));
y[Na - 1] = sum;
if(Na>1) sumf -= *af_ptr-- * *yf_ptr++;
yf[Na - 1] = sumf;
return fxp_to_float(sum) - sumf;
}
float iirOutBothL2(float yf[], float xf[], float af[], float bf[], float xfin,
fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], fxp_t xin, int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[Na - 1];
y_ptr = &y[1];
b_ptr = &b[Nb - 1];
x_ptr = &x[0];
float *af_ptr, *yf_ptr, *bf_ptr, *xf_ptr;
float sumf = 0;
af_ptr = &af[Na - 1];
yf_ptr = &yf[1];
bf_ptr = &bf[Nb - 1];
xf_ptr = &xf[0];
int i=0, j=1;
for (i = 0; i < Nb - 1; i++) {
x[i] = x[i+1];
sum = fxp_add(sum, fxp_mult(b[Nb - 1 - i], x[i]));
xf[i] = xf[i+1];
sumf += bf[Nb - 1 - i] * xf[i];
}
x[Nb - 1] = xin;
sum = fxp_add(sum, fxp_mult(b[Nb - 1 - i], x[i]));
xf[Nb - 1] = xfin;
sumf += bf[Nb - 1 - i] * xf[i];
for (j = 1; j < Na - 1; j++) {
sum = fxp_sub(sum, fxp_mult(a[Na - j], y[j]));
y[j] = y[j+1];
sumf -= af[Na - j] * yf[j];
yf[j] = yf[j+1];
}
if(Na>1) sum = fxp_sub(sum, fxp_mult(a[Na - j], y[j]));
y[Na - 1] = sum;
if(Na>1) sumf -= af[Na - j] * yf[j];
yf[Na - 1] = sumf;
return fxp_to_float(sum) - sumf;
}
# 25 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
extern digital_system ds;
extern hardware hw;
extern int generic_timer;
fxp_t fxp_direct_form_1(fxp_t y[], fxp_t x[], fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *y_ptr, *b_ptr, *x_ptr;
fxp_t sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum = fxp_add(sum, fxp_mult(*b_ptr++, *x_ptr--));
}
for (j = 1; j < Na; j++) {
sum = fxp_sub(sum, fxp_mult(*a_ptr++, *y_ptr--));
}
fxp_verify_overflow_node(sum, "An Overflow Occurred in the node a0");
sum = fxp_div(sum,a[0]);
return fxp_quantize(sum);
}
fxp_t fxp_direct_form_2(fxp_t w[], fxp_t x, fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *b_ptr, *w_ptr;
fxp_t sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
for (j = 1; j < Na; j++) {
w[0] = fxp_sub(w[0], fxp_mult(*a_ptr++, *w_ptr++));
}
w[0] = fxp_add(w[0], x);
w[0] = fxp_div(w[0], a[0]);
fxp_verify_overflow_node(w[0], "An Overflow Occurred in the node b0");
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum = fxp_add(sum, fxp_mult(*b_ptr++, *w_ptr++));
}
return fxp_quantize(sum);
}
fxp_t fxp_transposed_direct_form_2(fxp_t w[], fxp_t x, fxp_t a[], fxp_t b[], int Na, int Nb) {
fxp_t *a_ptr, *b_ptr;
fxp_t yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = fxp_add(fxp_mult(*b_ptr++, x), w[0]);
yout = fxp_div(yout, a[0]);
int j;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] = fxp_sub(w[j], fxp_mult(*a_ptr++, yout));
}
if (j < Nb - 1) {
w[j] = fxp_add(w[j], fxp_mult(*b_ptr++, x));
}
}
fxp_verify_overflow_node(w[j], "An Overflow Occurred in the node a0");
return fxp_quantize(yout);
}
double double_direct_form_1(double y[], double x[], double a[], double b[], int Na, int Nb) {
double *a_ptr, *y_ptr, *b_ptr, *x_ptr;
double sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum += *b_ptr++ * *x_ptr--;
}
for (j = 1; j < Na; j++) {
sum -= *a_ptr++ * *y_ptr--;
}
sum = (sum / a[0]);
return sum;
}
double double_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
double *a_ptr, *b_ptr, *w_ptr;
double sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
}
w[0] += x;
w[0] = w[0] / a[0];
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
}
return sum;
}
double double_transposed_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
yout = yout / a[0];
int j;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
}
}
return yout;
}
float float_direct_form_1(float y[], float x[], float a[], float b[], int Na, int Nb) {
float *a_ptr, *y_ptr, *b_ptr, *x_ptr;
float sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na - 1];
b_ptr = &b[0];
x_ptr = &x[Nb - 1];
int i, j;
for (i = 0; i < Nb; i++) {
sum += *b_ptr++ * *x_ptr--;
}
for (j = 1; j < Na; j++) {
sum -= *a_ptr++ * *y_ptr--;
}
sum = (sum / a[0]);
return sum;
}
float float_direct_form_2(float w[], float x, float a[], float b[], int Na, int Nb) {
float *a_ptr, *b_ptr, *w_ptr;
float sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
}
w[0] += x;
w[0] = w[0] / a[0];
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
}
return sum;
}
float float_transposed_direct_form_2(float w[], float x, float a[], float b[], int Na, int Nb) {
float *a_ptr, *b_ptr;
float yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
yout = yout / a[0];
int j;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
}
}
return yout;
}
double double_direct_form_1_MSP430(double y[], double x[], double a[], double b[], int Na, int Nb){
int timer1 = 0;
double *a_ptr, *y_ptr, *b_ptr, *x_ptr;
double sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na-1];
b_ptr = &b[0];
x_ptr = &x[Nb-1];
int i, j;
timer1 += 91;
for (i = 0; i < Nb; i++){
sum += *b_ptr++ * *x_ptr--;
timer1 += 47;
}
for (j = 1; j < Na; j++){
sum -= *a_ptr++ * *y_ptr--;
timer1 += 57;
}
timer1 += 3;
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
((void) sizeof ((
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ; else __assert_fail (
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
"(double) timer1 * hw.cycle <= ds.sample_time"
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h", 235, __extension__ __PRETTY_FUNCTION__); }))
# 235 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
;
return sum;
}
double double_direct_form_2_MSP430(double w[], double x, double a[], double b[], int Na, int Nb) {
int timer1 = 0;
double *a_ptr, *b_ptr, *w_ptr;
double sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
timer1 += 71;
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
timer1 += 54;
}
w[0] += x;
w[0] = w[0] / a[0];
w_ptr = &w[0];
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
timer1 += 46;
}
timer1 += 38;
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
((void) sizeof ((
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ; else __assert_fail (
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
"(double) timer1 * hw.cycle <= ds.sample_time"
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h", 262, __extension__ __PRETTY_FUNCTION__); }))
# 262 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
;
return sum;
}
double double_transposed_direct_form_2_MSP430(double w[], double x, double a[], double b[], int Na, int Nb) {
int timer1 = 0;
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
timer1 += 105;
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
timer1 += 41;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
timer1 += 38;
}
timer1 += 54;
}
timer1 += 7;
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
((void) sizeof ((
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
(double) timer1 * hw.cycle <= ds.sample_time
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
) ; else __assert_fail (
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
"(double) timer1 * hw.cycle <= ds.sample_time"
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h", 291, __extension__ __PRETTY_FUNCTION__); }))
# 291 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/realizations.h"
;
return yout;
}
double generic_timing_double_direct_form_1(double y[], double x[], double a[], double b[], int Na, int Nb){
generic_timer += ((6 * hw.assembly.push) + (3 * hw.assembly.in) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli) + (3 * hw.assembly.out) + (12 * hw.assembly.std));
double *a_ptr, *y_ptr, *b_ptr, *x_ptr;
double sum = 0;
a_ptr = &a[1];
y_ptr = &y[Na-1];
b_ptr = &b[0];
x_ptr = &x[Nb-1];
generic_timer += ((12 * hw.assembly.std) + (12 * hw.assembly.ldd) + (2 * hw.assembly.subi) + (2 * hw.assembly.sbci) + (4 * hw.assembly.lsl) + (4 * hw.assembly.rol) + (2 * hw.assembly.add) + (2 * hw.assembly.adc) + (1 * hw.assembly.adiw));
int i, j;
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (i = 0; i < Nb; i++){
generic_timer += ((20 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (2 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.sbc) + (10 * hw.assembly.std) + (2 * hw.assembly.ld) + (2 * hw.assembly.rcall) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.adiw) + (1 * hw.assembly.brge) + (1 * hw.assembly.rjmp));
sum += *b_ptr++ * *x_ptr--;
}
generic_timer += ((2 * hw.assembly.ldi) + (2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (j = 1; j < Na; j++){
generic_timer += ((22 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (2 * hw.assembly.subi) + (8 * hw.assembly.std) + (1 * hw.assembly.sbci) + (2 * hw.assembly.ld) + (2 * hw.assembly.rcall) + (1 * hw.assembly.sbc) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.adiw) + (1 * hw.assembly.brge) + (1 * hw.assembly.rjmp));
sum -= *a_ptr++ * *y_ptr--;
}
generic_timer += ((4 * hw.assembly.ldd) + (4 * hw.assembly.mov) + (1 * hw.assembly.adiw) + (1 * hw.assembly.in) + (1 * hw.assembly.cli) + (3 * hw.assembly.out) + (6 * hw.assembly.pop) + (1 * hw.assembly.ret));
return sum;
}
double generic_timing_double_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
generic_timer += ((8 * hw.assembly.push) + (14 * hw.assembly.std) + (3 * hw.assembly.out) + (3 * hw.assembly.in) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli));
double *a_ptr, *b_ptr, *w_ptr;
double sum = 0;
a_ptr = &a[1];
b_ptr = &b[0];
w_ptr = &w[1];
int k, j;
generic_timer += ((10 * hw.assembly.std) + (6 * hw.assembly.ldd) + (2 * hw.assembly.adiw));
generic_timer += ((2 * hw.assembly.ldi) + (2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (j = 1; j < Na; j++) {
w[0] -= *a_ptr++ * *w_ptr++;
generic_timer += ((23 * hw.assembly.ldd) + (32 * hw.assembly.mov) + (9 * hw.assembly.std) + (2 * hw.assembly.subi) + (3 * hw.assembly.ld) + (2 * hw.assembly.rcall) + (2 * hw.assembly.sbci) + (1 * hw.assembly.st) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brge));
}
w[0] += x;
w_ptr = &w[0];
generic_timer += ((13 * hw.assembly.ldd) + (12 * hw.assembly.mov) + (5 * hw.assembly.std) + (1 * hw.assembly.st) + (1 * hw.assembly.ld) + (1 * hw.assembly.rcall));
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (k = 0; k < Nb; k++) {
sum += *b_ptr++ * *w_ptr++;
generic_timer += ((20 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (10 * hw.assembly.std) + (2 * hw.assembly.rcall) + (2 * hw.assembly.ld) + (2 * hw.assembly.subi) + (2 * hw.assembly.sbci) + (1 * hw.assembly.adiw) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brge) + (1 * hw.assembly.rjmp));
}
generic_timer += ((4 * hw.assembly.ldd) + (4 * hw.assembly.mov) + (1 * hw.assembly.adiw) + (1 * hw.assembly.in) + (1 * hw.assembly.cli) + (3 * hw.assembly.out) + (8 * hw.assembly.pop) + (1 * hw.assembly.ret));
return sum;
}
double generic_timing_double_transposed_direct_form_2(double w[], double x, double a[], double b[], int Na, int Nb) {
generic_timer += ((8 * hw.assembly.push) + (14 * hw.assembly.std) + (3 * hw.assembly.out) + (3 * hw.assembly.in) + (1 * hw.assembly.sbiw) + (1 * hw.assembly.cli));
double *a_ptr, *b_ptr;
double yout = 0;
a_ptr = &a[1];
b_ptr = &b[0];
int Nw = Na > Nb ? Na : Nb;
yout = (*b_ptr++ * x) + w[0];
int j;
generic_timer += ((15 * hw.assembly.std) + (22 * hw.assembly.ldd) + (24 * hw.assembly.mov) + (2 * hw.assembly.rcall) + (2 * hw.assembly.ld) + (1 * hw.assembly.cp) + (1 * hw.assembly.cpc) + (1 * hw.assembly.subi) + (1 * hw.assembly.sbci) + (1 * hw.assembly.brge) + (1 * hw.assembly.adiw));
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
for (j = 0; j < Nw - 1; j++) {
w[j] = w[j + 1];
if (j < Na - 1) {
w[j] -= *a_ptr++ * yout;
}
if (j < Nb - 1) {
w[j] += *b_ptr++ * x;
}
generic_timer += ((70 * hw.assembly.mov) + (65 * hw.assembly.ldd) + (12 * hw.assembly.lsl) + (12 * hw.assembly.rol) + (15 * hw.assembly.std) + (6 * hw.assembly.add) + (6 * hw.assembly.adc) + (2 * hw.assembly.adiw) + (3 * hw.assembly.cpc) + (3 * hw.assembly.cp) + (5 * hw.assembly.ld) + (4 * hw.assembly.rcall) + (5 * hw.assembly.subi) + (3 * hw.assembly.rjmp) + (2 * hw.assembly.brlt) + (3 * hw.assembly.st) + (2 * hw.assembly.sbci) + (3 * hw.assembly.sbc) + (1 * hw.assembly.brge));
}
generic_timer += ((4 * hw.assembly.ldd) + (4 * hw.assembly.mov) + (8 * hw.assembly.pop) + (3 * hw.assembly.out) + (1 * hw.assembly.in) + (1 * hw.assembly.cli) + (1 * hw.assembly.adiw) + (1 * hw.assembly.ret));
return yout;
}
void double_direct_form_1_impl2(double x[], int x_size, double b[], int b_size, double a[], int a_size, double y[]){
int i = 0; int j = 0;
double v[x_size];
for(i = 0; i < x_size; i++){
v[i] = 0;
for(j = 0; j < b_size; j++){
if (j > i) break;
v[i] = v[i] + x[i-j] * b[j];
}
}
y[0] = v[0];
for(i = 1; i < x_size; i++){
y[i] = 0;
y[i] = y[i] + v[i];
for(j = 1; j < a_size; j++){
if (j > i) break;
y[i] = y[i] + y[i-j] * ((-1) * a[j]);
}
}
}
void fxp_direct_form_1_impl2(fxp_t x[], int x_size, fxp_t b[], int b_size, fxp_t a[], int a_size, fxp_t y[]){
int i = 0; int j = 0;
fxp_t v[x_size];
for(i = 0; i < x_size; i++){
v[i] = 0;
for(j = 0; j < b_size; j++){
if (j > i) break;
v[i] = fxp_add(v[i], fxp_mult(x[i-j], b[j]));
}
}
y[0] = v[0];
for(i = 1; i < x_size; i++){
y[i] = 0;
y[i] = fxp_add(y[i], v[i]);
for(j = 1; j < a_size; j++){
if (j > i) break;
y[i] = fxp_add(y[i], fxp_mult(y[i-j] , -a[j]));
}
}
}
# 26 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h"
# 1 "/usr/include/assert.h" 1 3 4
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h" 2
# 1 "/usr/include/assert.h" 1 3 4
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/delta-operator.h" 2
int nchoosek(int n, int k){
if (k == 0)
return 1;
return (n * nchoosek(n - 1, k - 1)) / k;
}
void generate_delta_coefficients(double vetor[], double out[], int n, double delta){
int i,j;
int N = n - 1;
double sum_delta_operator;
for(i=0; i<=N; i++)
{
sum_delta_operator = 0;
for(j=0; j<=i; j++)
{
sum_delta_operator = sum_delta_operator + vetor[j]*nchoosek(N-j,i-j);
}
out[i] = internal_pow(delta,N-i)*sum_delta_operator;
}
}
void get_delta_transfer_function(double b[], double b_out[], int b_size, double a[], double a_out[], int a_size, double delta){
generate_delta_coefficients(b, b_out, b_size, delta);
generate_delta_coefficients(a, a_out, a_size, delta);
}
void get_delta_transfer_function_with_base(double b[], double b_out[], int b_size, double a[], double a_out[], int a_size, double delta){
int i,j;
int N = a_size - 1;
int M = b_size - 1;
double sum_delta_operator;
for(i=0; i<=N; i++)
{
sum_delta_operator = 0;
for(j=0; j<=i; j++)
{
sum_delta_operator = sum_delta_operator + a[j]*nchoosek(N-j,i-j);
}
a_out[i] = internal_pow(delta,N-i)*sum_delta_operator;
}
for(i=0; i<=M; i++)
{
sum_delta_operator = 0;
for(j=0; j<=i; j++)
{
sum_delta_operator = sum_delta_operator + b[j]*nchoosek(M-j,i-j);
}
b_out[i] = internal_pow(delta,M-i)*sum_delta_operator;
}
}
# 27 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/closed-loop.h" 1
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/closed-loop.h"
void ft_closedloop_series(double c_num[], int Nc_num, double c_den[], int Nc_den, double model_num[], int Nmodel_num, double model_den[], int Nmodel_den, double ans_num[], int Nans_num, double ans_den[], int Nans_den){
Nans_num = Nc_num + Nmodel_num - 1;
Nans_den = Nc_den + Nmodel_den - 1 ;
double den_mult [Nans_den];
poly_mult(c_num, Nc_num, model_num, Nmodel_num, ans_num, Nans_num);
poly_mult(c_den, Nc_den, model_den, Nmodel_den, den_mult, Nans_den );
poly_sum(ans_num, Nans_num , den_mult, Nans_den , ans_den, Nans_den);
}
void ft_closedloop_sensitivity(double c_num[], int Nc_num, double c_den[], int Nc_den, double model_num[], int Nmodel_num, double model_den[], int Nmodel_den, double ans_num[], int Nans_num, double ans_den[], int Nans_den){
int Nans_num_p = Nc_num + Nmodel_num-1;
Nans_den = Nc_den + Nmodel_den-1;
Nans_num = Nc_den + Nmodel_den-1;
double num_mult [Nans_num_p];
poly_mult(c_den, Nc_den, model_den, Nmodel_den, ans_num, Nans_num);
poly_mult(c_num, Nc_num, model_num, Nmodel_num, num_mult, Nans_num_p);
poly_sum(ans_num, Nans_num, num_mult, Nans_num_p, ans_den, Nans_den);
}
void ft_closedloop_feedback(double c_num[], int Nc_num, double c_den[], int Nc_den, double model_num[], int Nmodel_num, double model_den[], int Nmodel_den, double ans_num[], int Nans_num, double ans_den[], int Nans_den){
Nans_num = Nc_den + Nmodel_num - 1;
Nans_den = Nc_den + Nmodel_den - 1;
int Nnum_mult = Nc_num + Nmodel_num - 1;
double den_mult [Nans_den];
double num_mult [Nnum_mult];
poly_mult(c_num, Nc_num, model_num, Nmodel_num, num_mult, Nnum_mult);
poly_mult(c_den, Nc_den, model_den, Nmodel_den, den_mult, Nans_den);
poly_sum(num_mult, Nnum_mult, den_mult, Nans_den, ans_den, Nans_den);
poly_mult(c_den, Nc_den, model_num, Nmodel_num, ans_num, Nans_num);
}
int check_stability_closedloop(double a[], int n, double plant_num[], int p_num_size, double plant_den[], int p_den_size){
int columns = n;
double m[2 * n - 1][n];
int i,j;
int first_is_positive = 0;
double * p_num = plant_num;
double * p_den = plant_den;
double sum = 0;
for (i=0; i < n; i++){
sum += a[i];
}
__DSVERIFIER_assert(sum > 0);
sum = 0;
for (i=0; i < n; i++){
sum += a[i] * internal_pow(-1, n-1-i);
}
sum = sum * internal_pow(-1, n-1);
__DSVERIFIER_assert(sum > 0);
__DSVERIFIER_assert(internal_abs(a[n-1]) < a[0]);
for (i=0; i < 2 * n - 1; i++){
for (j=0; j < columns; j++){
m[i][j] = 0;
if (i == 0){
m[i][j] = a[j];
continue;
}
if (i % 2 != 0 ){
int x;
for(x=0; x<columns;x++){
m[i][x] = m[i-1][columns-x-1];
}
columns = columns - 1;
j = columns;
}else{
__DSVERIFIER_assert(m[i-2][0] > 0);
m[i][j] = m[i-2][j] - (m[i-2][columns] / m[i-2][0]) * m[i-1][j];
__DSVERIFIER_assert((m[0][0] >= 0) && (m[i][0] >= 0));
}
}
}
return 1;
}
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
extern digital_system ds;
extern digital_system plant;
extern digital_system control;
extern implementation impl;
extern filter_parameters filter;
extern hardware hw;
void initialization(){
if (impl.frac_bits >= 32){
printf("impl.frac_bits must be less than word width!\n");
}
if (impl.int_bits >= 32 - impl.frac_bits){
printf("impl.int_bits must be less than word width subtracted by precision!\n");
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
((void) sizeof ((
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
0
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
0
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
) ; else __assert_fail (
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
"0"
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h", 33, __extension__ __PRETTY_FUNCTION__); }))
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
;
}
if(impl.frac_bits >= 31){
_fxp_one = 0x7fffffff;
}else{
_fxp_one = (0x00000001 << impl.frac_bits);
}
_fxp_half = (0x00000001 << (impl.frac_bits - 1));
_fxp_minus_one = -(0x00000001 << impl.frac_bits);
_fxp_min = -(0x00000001 << (impl.frac_bits + impl.int_bits - 1));
_fxp_max = (0x00000001 << (impl.frac_bits + impl.int_bits - 1)) - 1;
_fxp_fmask = ((((int32_t) 1) << impl.frac_bits) - 1);
_fxp_imask = ((0x80000000) >> (32 - impl.frac_bits - 1));
_dbl_min = _fxp_min;
_dbl_min /= (1 << impl.frac_bits);
_dbl_max = _fxp_max;
_dbl_max /= (1 << impl.frac_bits);
if ((impl.scale == 0) || (impl.scale == 1)){
impl.scale = 1;
return;
}
if (impl.min != 0){
impl.min = impl.min / impl.scale;
}
if (impl.max != 0){
impl.max = impl.max / impl.scale;
}
# 80 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/initialization.h"
}
# 29 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/state-space.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/state-space.h"
extern digital_system_state_space _controller;
extern int nStates;
extern int nInputs;
extern int nOutputs;
double double_state_space_representation(void){
double result1[4][4];
double result2[4][4];
int i, j;
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller.A,_controller.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller.B,_controller.inputs,result2);
double_add_matrix(nStates,
1,
result1,
result2,
_controller.states);
return _controller.outputs[0][0];
}
double fxp_state_space_representation(void){
fxp_t result1[4][4];
fxp_t result2[4][4];
int i, j;
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
fxp_t A_fpx[4][4];
fxp_t B_fpx[4][4];
fxp_t C_fpx[4][4];
fxp_t D_fpx[4][4];
fxp_t states_fpx[4][4];
fxp_t inputs_fpx[4][4];
fxp_t outputs_fpx[4][4];
for(i=0; i<4;i++){
for(j=0; j<4;j++){
A_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
B_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
C_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
D_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
states_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
inputs_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
outputs_fpx[i][j]=0;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
A_fpx[i][j]= fxp_double_to_fxp(_controller.A[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
B_fpx[i][j]= fxp_double_to_fxp(_controller.B[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
C_fpx[i][j]= fxp_double_to_fxp(_controller.C[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
D_fpx[i][j]= fxp_double_to_fxp(_controller.D[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
states_fpx[i][j]= fxp_double_to_fxp(_controller.states[i][j]);
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
inputs_fpx[i][j]= fxp_double_to_fxp(_controller.inputs[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
outputs_fpx[i][j]= fxp_double_to_fxp(_controller.outputs[i][j]);
}
}
fxp_matrix_multiplication(nOutputs,nStates,nStates,1,C_fpx,states_fpx,result1);
fxp_matrix_multiplication(nOutputs,nInputs,nInputs,1,D_fpx,inputs_fpx,result2);
fxp_add_matrix(nOutputs,
1,
result1,
result2,
outputs_fpx);
fxp_matrix_multiplication(nStates,nStates,nStates,1,A_fpx,states_fpx,result1);
fxp_matrix_multiplication(nStates,nInputs,nInputs,1,B_fpx,inputs_fpx,result2);
fxp_add_matrix(nStates,
1,
result1,
result2,
states_fpx);
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j]= fxp_to_double(states_fpx[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
_controller.outputs[i][j]= fxp_to_double(outputs_fpx[i][j]);
}
}
return _controller.outputs[0][0];
}
# 30 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/filter_functions.h" 1
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/core/filter_functions.h"
double sinTyl(double x, int precision){
double sine;
double xsquared = x*x;
double aux;
if (precision < 0)
{
printf("Warning: Function sinTyl from bmc/core/filter_functions.h: "
"Precision must be a positive integer. Assuming 0 precision\n");
precision = 0;
}
if (precision >= 0)
{
aux = 0;
sine = aux;
if (precision >= 1)
{
aux = x;
sine += aux;
if (precision >= 2)
{
aux = aux*xsquared;
sine -= aux/6;
if (precision >= 3)
{
aux = aux*xsquared;
sine +=aux/120;
if(precision >=4)
{
aux = aux*xsquared;
sine -=aux/5040;
if(precision >= 5)
{
aux = aux*xsquared;
sine +=aux/362880;
if(precision >= 6)
{
aux = aux*xsquared;
sine -=aux/39916800;
if (precision >= 7)
printf("Warning: Function sinTyl "
"from bmc/core/filter_functions.h: Precision "
"representation exceeded. Assuming maximum precision of 6\n");
}
}
}
}
}
}
}
return sine;
}
double cosTyl(double x, int precision){
double cosine;
double xsquared = x*x;
double aux;
if (precision < 0)
{
printf("Warning: Function cosTyl from bmc/core/filter_functions.h: "
"Precision must be a positive integer. Assuming 0 precision\n");
precision = 0;
}
if (precision >= 0)
{
aux = 0;
cosine = aux;
if (precision >= 1)
{
aux = 1;
cosine = 1;
if (precision >= 2)
{
aux = xsquared;
cosine -= aux/2;
if (precision >= 3)
{
aux = aux*xsquared;
cosine += aux/24;
if(precision >=4)
{
aux = aux*xsquared;
cosine -=aux/720;
if(precision >= 5)
{
aux = aux*xsquared;
cosine +=aux/40320;
if(precision >= 6)
{
aux = aux*xsquared;
cosine -=aux/3628800;
if (precision >= 7) printf("Warning: Function sinTyl "
"from bmc/core/filter_functions.h: Precision "
"representation exceeded. Assuming maximum precision of 6\n");
}
}
}
}
}
}
}
return cosine;
}
double atanTyl(double x, int precision){
double atangent;
double xsquared = x*x;
double aux;
if (precision < 0)
{
printf("Warning: Function sinTyl from bmc/core/filter_functions.h: "
"Precision must be a positive integer. Assuming 0 precision\n");
precision = 0;
}
if (precision >= 0)
{
aux = 0;
atangent = aux;
if (precision >= 1)
{
aux = x;
atangent = aux;
if (precision >= 2)
{
aux = xsquared;
atangent -= aux/3;
if (precision >= 3)
{
aux = aux*xsquared;
atangent += aux/5;
if(precision >=4)
{
aux = aux*xsquared;
atangent -=aux/7;
if (precision >= 7)
printf("Warning: Function sinTyl from bmc/core/filter_functions.h: "
"Precision representation exceeded. Assuming maximum precision of 4\n");
}
}
}
}
}
return atangent;
}
float sqrt1(const float x)
{
const float xhalf = 0.5f*x;
union
{
float x;
int i;
} u;
u.x = x;
u.i = 0x5f3759df - (u.i >> 1);
return x*u.x*(1.5f - xhalf*u.x*u.x);
}
float sqrt2(const float x)
{
union
{
int i;
float x;
} u;
u.x = x;
u.i = (1<<29) + (u.i >> 1) - (1<<22);
return u.x;
}
float fabsolut(float x)
{
if (x < 0)
x = -x;
return x;
}
static float sqrt3(float val)
{
float x = val/10;
float dx;
double diff;
double min_tol = 0.00001;
int i, flag;
flag = 0;
if (val == 0 ) x = 0;
else
{
for (i=1;i<20;i++)
{
if (!flag)
{
dx = (val - (x*x)) / (2.0 * x);
x = x + dx;
diff = val - (x*x);
if (fabsolut(diff) <= min_tol) flag = 1;
}
else x =x;
}
}
return (x);
}
# 31 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h" 1
# 19 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
int nondet_int();
float nondet_float();
extern digital_system ds;
extern implementation impl;
int verify_overflow(void) {
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 73 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
int i;
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_int();
__DSVERIFIER_assume(x[i] >= min_fxp && x[i] <= max_fxp);
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t xaux[ds.b_size];
fxp_t waux[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
}
fxp_t xk, temp;
fxp_t *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for (i = 0; i < X_SIZE_VALUE; ++i) {
shiftL(x[i], xaux, ds.b_size);
y[i] = fxp_direct_form_1(yaux, xaux, a_fxp, b_fxp, ds.a_size, ds.b_size);
shiftL(y[i], yaux, ds.a_size);
# 174 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_overflow.h"
}
overflow_mode = 1;
fxp_verify_overflow_array(y, X_SIZE_VALUE);
return 0;
}
# 33 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 1
# 15 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
extern digital_system ds;
extern implementation impl;
extern digital_system_state_space _controller;
extern int nStates;
extern int nInputs;
extern int nOutputs;
int verify_limit_cycle_state_space(void){
double stateMatrix[4][4];
double outputMatrix[4][4];
double arrayLimitCycle[4];
double result1[4][4];
double result2[4][4];
int i, j, k;
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
stateMatrix[i][j]=0;
outputMatrix[i][j]=0;
}
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
k = 0;
for (i = 1; i < 0; i++) {
double_matrix_multiplication(nStates,nStates,nStates,1,_controller.A,_controller.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller.B,_controller.inputs,result2);
double_add_matrix(nStates,
1,
result1,
result2,
_controller.states);
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
int l;
for(l = 0; l < nStates; l++){
stateMatrix[l][k] = _controller.states[l][0];
}
for(l = 0; l < nOutputs; l++){
stateMatrix[l][k] = _controller.outputs[l][0];
}
k++;
}
printf("#matrix STATES -------------------------------");
print_matrix(stateMatrix,nStates,0);
printf("#matrix OUTPUTS -------------------------------");
print_matrix(outputMatrix,nOutputs,0);
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
((void) sizeof ((
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ; else __assert_fail (
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
"0"
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h", 93, __extension__ __PRETTY_FUNCTION__); }))
# 93 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
;
for(i=0; i<nStates;i++){
for(j=0; j<0;j++){
arrayLimitCycle[j] = stateMatrix[i][j];
}
double_check_persistent_limit_cycle(arrayLimitCycle,0);
}
for(i=0; i<nOutputs;i++){
for(j=0; j<0;j++){
arrayLimitCycle[j] = outputMatrix[i][j];
}
double_check_persistent_limit_cycle(arrayLimitCycle,0);
}
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
((void) sizeof ((
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
0
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
) ; else __assert_fail (
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
"0"
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h", 110, __extension__ __PRETTY_FUNCTION__); }))
# 110 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
;
}
int verify_limit_cycle(void){
overflow_mode = 3;
int i;
int Set_xsize_at_least_two_times_Na = 2 * ds.a_size;
printf("X_SIZE must be at least 2 * ds.a_size");
__DSVERIFIER_assert(X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na);
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 168 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t xaux[ds.b_size];
int nondet_constant_input = nondet_int();
__DSVERIFIER_assume(nondet_constant_input >= min_fxp && nondet_constant_input <= max_fxp);
for (i = 0; i < X_SIZE_VALUE; ++i) {
x[i] = nondet_constant_input;
y[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = nondet_constant_input;
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t y0[ds.a_size];
fxp_t waux[Nw];
fxp_t w0[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = nondet_int();
__DSVERIFIER_assume(yaux[i] >= min_fxp && yaux[i] <= max_fxp);
y0[i] = yaux[i];
}
# 213 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
fxp_t xk, temp;
fxp_t *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for(i=0; i<X_SIZE_VALUE; ++i){
shiftL(x[i], xaux, ds.b_size);
y[i] = fxp_direct_form_1(yaux, xaux, a_fxp, b_fxp, ds.a_size, ds.b_size);
shiftL(y[i], yaux, ds.a_size);
# 278 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle.h"
}
fxp_check_persistent_limit_cycle(y, X_SIZE_VALUE);
return 0;
}
# 34 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
extern digital_system ds;
extern implementation impl;
int verify_error(void){
overflow_mode = 2;
double a_cascade[100];
int a_cascade_size;
double b_cascade[100];
int b_cascade_size;
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 69 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
double yf[X_SIZE_VALUE];
double xf[X_SIZE_VALUE];
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t xaux[ds.b_size];
fxp_t waux[Nw];
double yfaux[ds.a_size];
double xfaux[ds.b_size];
double wfaux[Nw];
int i;
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
yfaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
xfaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
wfaux[i] = 0;
}
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_int();
__DSVERIFIER_assume(x[i] >= min_fxp && x[i] <= max_fxp);
yf[i] = 0.0f;
xf[i] = fxp_to_double(x[i]);
}
for (i = 0; i < X_SIZE_VALUE; ++i) {
shiftL(x[i], xaux, ds.b_size);
y[i] = fxp_direct_form_1(yaux, xaux, a_fxp, b_fxp, ds.a_size, ds.b_size);
shiftL(y[i], yaux, ds.a_size);
shiftLDouble(xf[i], xfaux, ds.b_size);
yf[i] = double_direct_form_1(yfaux, xfaux, ds.a, ds.b, ds.a_size, ds.b_size);
shiftLDouble(yf[i], yfaux, ds.a_size);
# 169 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error.h"
double absolute_error = yf[i] - fxp_to_double(y[i]);
__DSVERIFIER_assert(absolute_error < (impl.max_error) && absolute_error > (-impl.max_error));
}
return 0;
}
# 35 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 1
# 13 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
extern digital_system ds;
extern implementation impl;
int verify_zero_input_limit_cycle(void){
overflow_mode = 3;
int i,j;
int Set_xsize_at_least_two_times_Na = 2 * ds.a_size;
printf("X_SIZE must be at least 2 * ds.a_size");
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
((void) sizeof ((
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
) ; else __assert_fail (
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
"X_SIZE_VALUE >= Set_xsize_at_least_two_times_Na"
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h", 23, __extension__ __PRETTY_FUNCTION__); }))
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
;
fxp_t a_fxp[ds.a_size];
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
# 71 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
fxp_t y[X_SIZE_VALUE];
fxp_t x[X_SIZE_VALUE];
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = 0;
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
fxp_t yaux[ds.a_size];
fxp_t xaux[ds.b_size];
fxp_t waux[Nw];
fxp_t y0[ds.a_size];
fxp_t w0[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = nondet_int();
__DSVERIFIER_assume(yaux[i] >= min_fxp && yaux[i] <= max_fxp);
y0[i] = yaux[i];
}
# 111 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
fxp_t xk, temp;
fxp_t *aptr, *bptr, *xptr, *yptr, *wptr;
for(i=0; i<X_SIZE_VALUE; ++i){
shiftL(x[i], xaux, ds.b_size);
y[i] = fxp_direct_form_1(yaux, xaux, a_fxp, b_fxp, ds.a_size, ds.b_size);
shiftL(y[i], yaux, ds.a_size);
# 188 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_zero_input_limit_cycle.h"
}
fxp_check_persistent_limit_cycle(y, X_SIZE_VALUE);
return 0;
}
# 36 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 1
# 16 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
int nondet_int();
float nondet_float();
extern digital_system ds;
extern implementation impl;
extern hardware hw;
int generic_timer = 0;
int verify_generic_timing(void) {
double y[X_SIZE_VALUE];
double x[X_SIZE_VALUE];
int i;
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_float();
__DSVERIFIER_assume(x[i] >= impl.min && x[i] <= impl.max);
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
double yaux[ds.a_size];
double xaux[ds.b_size];
double waux[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
}
double xk, temp;
double *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
generic_timer += ((2 * hw.assembly.std) + (1 * hw.assembly.rjmp));
double initial_timer = generic_timer;
for (i = 0; i < X_SIZE_VALUE; ++i) {
generic_timer += ((2 * hw.assembly.ldd) + (1 * hw.assembly.adiw) + (2 * hw.assembly.std));
generic_timer += ((2 * hw.assembly.ldd) + (1 * hw.assembly.cpi) + (1 * hw.assembly.cpc) + (1 * hw.assembly.brlt));
generic_timing_shift_l_double(x[i], xaux, ds.b_size);
y[i] = generic_timing_double_direct_form_1(yaux, xaux, ds.a, ds.b, ds.a_size, ds.b_size);
generic_timing_shift_l_double(y[i], yaux, ds.a_size);
# 88 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
double spent_time = (((double) generic_timer) * hw.cycle);
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
((void) sizeof ((
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
spent_time <= ds.sample_time
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
spent_time <= ds.sample_time
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
) ; else __assert_fail (
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
"spent_time <= ds.sample_time"
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h", 89, __extension__ __PRETTY_FUNCTION__); }))
# 89 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_generic_timing.h"
;
generic_timer = initial_timer;
}
return 0;
}
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h" 1
# 16 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h"
int nondet_int();
float nondet_float();
extern digital_system ds;
extern implementation impl;
int verify_timing_msp_430(void) {
double y[X_SIZE_VALUE];
double x[X_SIZE_VALUE];
int i;
for (i = 0; i < X_SIZE_VALUE; ++i) {
y[i] = 0;
x[i] = nondet_float();
__DSVERIFIER_assume(x[i] >= impl.min && x[i] <= impl.max);
}
int Nw = 0;
Nw = ds.a_size > ds.b_size ? ds.a_size : ds.b_size;
double yaux[ds.a_size];
double xaux[ds.b_size];
double waux[Nw];
for (i = 0; i < ds.a_size; ++i) {
yaux[i] = 0;
}
for (i = 0; i < ds.b_size; ++i) {
xaux[i] = 0;
}
for (i = 0; i < Nw; ++i) {
waux[i] = 0;
}
double xk, temp;
double *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for (i = 0; i < X_SIZE_VALUE; ++i) {
shiftL(x[i], xaux, ds.b_size);
y[i] = double_direct_form_1_MSP430(yaux, xaux, ds.a, ds.b, ds.a_size, ds.b_size);
shiftL(y[i], yaux, ds.a_size);
# 121 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_timing_msp430.h"
}
return 0;
}
# 38 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 1
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
extern digital_system ds;
extern implementation impl;
int verify_stability(void){
overflow_mode = 0;
fxp_t a_fxp[ds.a_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
double _a[ds.a_size];
fxp_to_double_array(_a, a_fxp, ds.a_size);
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
((void) sizeof ((
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
check_stability(_a, ds.a_size)
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
check_stability(_a, ds.a_size)
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
) ; else __assert_fail (
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
"check_stability(_a, ds.a_size)"
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h", 37, __extension__ __PRETTY_FUNCTION__); }))
# 37 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
;
# 83 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability.h"
return 0;
}
# 39 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_minimum_phase.h" 1
# 21 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_minimum_phase.h"
extern digital_system ds;
extern implementation impl;
int verify_minimum_phase(void){
overflow_mode = 0;
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
double _b[ds.b_size];
fxp_to_double_array(_b, b_fxp, ds.b_size);
__DSVERIFIER_assert(check_stability(_b, ds.b_size));
# 85 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_minimum_phase.h"
return 0;
}
# 40 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability_closedloop.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability_closedloop.h"
extern digital_system plant;
extern digital_system plant_cbmc;
extern digital_system controller;
int verify_stability_closedloop_using_dslib(void){
double * c_num = controller.b;
int c_num_size = controller.b_size;
double * c_den = controller.a;
int c_den_size = controller.a_size;
fxp_t c_num_fxp[controller.b_size];
fxp_double_to_fxp_array(c_num, c_num_fxp, controller.b_size);
fxp_t c_den_fxp[controller.a_size];
fxp_double_to_fxp_array(c_den, c_den_fxp, controller.a_size);
double c_num_qtz[controller.b_size];
fxp_to_double_array(c_num_qtz, c_num_fxp, controller.b_size);
double c_den_qtz[controller.a_size];
fxp_to_double_array(c_den_qtz, c_den_fxp, controller.a_size);
double * p_num = plant.b;
int p_num_size = plant.b_size;
double * p_den = plant.a;
int p_den_size = plant.a_size;
double ans_num[100];
int ans_num_size = controller.b_size + plant.b_size - 1;
double ans_den[100];
int ans_den_size = controller.a_size + plant.a_size - 1;
# 68 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_stability_closedloop.h"
printf("Verifying stability for closedloop function\n");
__DSVERIFIER_assert(check_stability_closedloop(ans_den, ans_den_size, p_num, p_num_size, p_den, p_den_size));
return 0;
}
# 41 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h" 1
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h"
extern digital_system plant;
extern digital_system plant_cbmc;
extern digital_system controller;
double nondet_double();
int verify_limit_cycle_closed_loop(void){
overflow_mode = 3;
double * c_num = controller.b;
int c_num_size = controller.b_size;
double * c_den = controller.a;
int c_den_size = controller.a_size;
fxp_t c_num_fxp[controller.b_size];
fxp_double_to_fxp_array(c_num, c_num_fxp, controller.b_size);
fxp_t c_den_fxp[controller.a_size];
fxp_double_to_fxp_array(c_den, c_den_fxp, controller.a_size);
double c_num_qtz[controller.b_size];
fxp_to_double_array(c_num_qtz, c_num_fxp, controller.b_size);
double c_den_qtz[controller.a_size];
fxp_to_double_array(c_den_qtz, c_den_fxp, controller.a_size);
double * p_num = plant.b;
int p_num_size = plant.b_size;
double * p_den = plant.a;
int p_den_size = plant.a_size;
double ans_num[100];
int ans_num_size = controller.b_size + plant.b_size - 1;
double ans_den[100];
int ans_den_size = controller.a_size + plant.a_size - 1;
int i;
double y[X_SIZE_VALUE];
double x[X_SIZE_VALUE];
double xaux[ans_num_size];
double nondet_constant_input = nondet_double();
__DSVERIFIER_assume(nondet_constant_input >= impl.min && nondet_constant_input <= impl.max);
for (i = 0; i < X_SIZE_VALUE; ++i) {
x[i] = nondet_constant_input;
y[i] = 0;
}
for (i = 0; i < ans_num_size; ++i) {
xaux[i] = nondet_constant_input;
}
double yaux[ans_den_size];
double y0[ans_den_size];
int Nw = ans_den_size > ans_num_size ? ans_den_size : ans_num_size;
double waux[Nw];
double w0[Nw];
for (i = 0; i < ans_den_size; ++i) {
yaux[i] = nondet_int();
__DSVERIFIER_assume(yaux[i] >= impl.min && yaux[i] <= impl.max);
y0[i] = yaux[i];
}
# 112 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h"
double xk, temp;
double *aptr, *bptr, *xptr, *yptr, *wptr;
int j;
for(i=0; i<X_SIZE_VALUE; ++i){
shiftLDouble(x[i], xaux, ans_num_size);
y[i] = double_direct_form_1(yaux, xaux, ans_den, ans_num, ans_den_size, ans_num_size);
shiftLDouble(y[i], yaux, ans_den_size);
# 137 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_limit_cycle_closedloop.h"
}
double_check_persistent_limit_cycle(y, X_SIZE_VALUE);
return 0;
}
# 42 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h" 1
# 23 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
extern digital_system plant;
extern digital_system plant_cbmc;
extern digital_system controller;
int verify_error_closedloop(void){
overflow_mode = 3;
double * c_num = controller.b;
int c_num_size = controller.b_size;
double * c_den = controller.a;
int c_den_size = controller.a_size;
fxp_t c_num_fxp[controller.b_size];
fxp_double_to_fxp_array(c_num, c_num_fxp, controller.b_size);
fxp_t c_den_fxp[controller.a_size];
fxp_double_to_fxp_array(c_den, c_den_fxp, controller.a_size);
double c_num_qtz[controller.b_size];
fxp_to_double_array(c_num_qtz, c_num_fxp, controller.b_size);
double c_den_qtz[controller.a_size];
fxp_to_double_array(c_den_qtz, c_den_fxp, controller.a_size);
double * p_num = plant.b;
int p_num_size = plant.b_size;
double * p_den = plant.a;
int p_den_size = plant.a_size;
double ans_num_double[100];
double ans_num_qtz[100];
int ans_num_size = controller.b_size + plant.b_size - 1;
double ans_den_qtz[100];
double ans_den_double[100];
int ans_den_size = controller.a_size + plant.a_size - 1;
# 77 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
int i;
double y_qtz[X_SIZE_VALUE];
double y_double[X_SIZE_VALUE];
double x_qtz[X_SIZE_VALUE];
double x_double[X_SIZE_VALUE];
double xaux_qtz[ans_num_size];
double xaux_double[ans_num_size];
double xaux[ans_num_size];
double nondet_constant_input = nondet_double();
__DSVERIFIER_assume(nondet_constant_input >= impl.min && nondet_constant_input <= impl.max);
for (i = 0; i < X_SIZE_VALUE; ++i) {
x_qtz[i] = nondet_constant_input;
x_double[i] = nondet_constant_input;
y_qtz[i] = 0;
y_double[i] = 0;
}
for (i = 0; i < ans_num_size; ++i) {
xaux_qtz[i] = nondet_constant_input;
xaux_double[i] = nondet_constant_input;
}
double yaux_qtz[ans_den_size];
double yaux_double[ans_den_size];
double y0_qtz[ans_den_size];
double y0_double[ans_den_size];
int Nw = ans_den_size > ans_num_size ? ans_den_size : ans_num_size;
double waux_qtz[Nw];
double waux_double[Nw];
double w0_qtz[Nw];
double w0_double[Nw];
for (i = 0; i < ans_den_size; ++i) {
yaux_qtz[i] = 0;
yaux_double[i] = 0;
}
for(i=0; i<X_SIZE_VALUE; ++i){
shiftLDouble(x_qtz[i], xaux_qtz, ans_num_size);
y_qtz[i] = double_direct_form_1(yaux_qtz, xaux_qtz, ans_den_qtz, ans_num_qtz, ans_den_size, ans_num_size);
shiftLDouble(y_qtz[i], yaux_qtz, ans_den_size);
shiftLDouble(x_double[i], xaux_double, ans_num_size);
y_double[i] = double_direct_form_1(yaux_double, xaux_double, ans_den_double, ans_num_double, ans_den_size, ans_num_size);
shiftLDouble(y_double[i], yaux_double, ans_den_size);
# 156 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_closedloop.h"
double absolute_error = y_double[i] - fxp_to_double(y_qtz[i]);
__DSVERIFIER_assert(absolute_error < (impl.max_error) && absolute_error > (-impl.max_error));
}
return 0;
}
# 43 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 1
# 20 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
extern digital_system_state_space _controller;
extern double error_limit;
extern int closed_loop;
double new_state[4][4];
double new_stateFWL[4][4];
digital_system_state_space _controller_fxp;
digital_system_state_space _controller_double;
double ss_system_quantization_error(fxp_t inputs){
digital_system_state_space __backupController;
int i;
int j;
_controller.inputs[0][0] = inputs;
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
__backupController.A[i][j]= (_controller.A[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
__backupController.B[i][j]= (_controller.B[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
__backupController.C[i][j]= (_controller.C[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
__backupController.D[i][j]= (_controller.D[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
__backupController.states[i][j]= (_controller.states[i][j]);
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
__backupController.inputs[i][j]= (_controller.inputs[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
__backupController.outputs[i][j]= (_controller.outputs[i][j]);
}
}
double __quant_error = 0.0;
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j]= (new_state[i][j]);
}
}
double output_double = double_state_space_representation();
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_state[i][j]= (_controller.states[i][j]);
}
}
__backupController.inputs[0][0] = inputs;
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
_controller.A[i][j] = __backupController.A[i][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
_controller.B[i][j] = __backupController.B[i][j];
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
_controller.C[i][j] = __backupController.C[i][j];
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
_controller.D[i][j] = __backupController.D[i][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j] = __backupController.states[i][j];
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
_controller.inputs[i][j] = __backupController.inputs[i][j];
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
_controller.outputs[i][j] = __backupController.outputs[i][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
_controller.states[i][j]= (new_stateFWL[i][j]);
}
}
double output_fxp = fxp_state_space_representation();
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_stateFWL[i][j]= (_controller.states[i][j]);
}
}
__quant_error = output_double - output_fxp;
return __quant_error;
}
double fxp_ss_closed_loop_quantization_error(double reference){
double reference_aux[4][4];
double result1[4][4];
double temp_result1[4][4];
double result2[4][4];
double temp_states[4][4];
fxp_t K_fxp[4][4];
fxp_t states_fxp[4][4];
fxp_t result_fxp[4][4];
unsigned int i;
unsigned int j;
unsigned int k;
short unsigned int flag = 0;
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
if(_controller_fxp.D[i][j] != 0){
flag = 1;
}
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
reference_aux[i][j]=0;
K_fxp[i][j] = 0;
}
}
for(i=0; i<nInputs;i++){
reference_aux[i][0]= reference;
}
for(i=0; i<4;i++){
states_fxp[i][0]=0;
}
for(i=0; i<nStates;i++){
K_fxp[0][i]= fxp_double_to_fxp(_controller_fxp.K[0][i]);
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
for(k=0; k<nStates;k++)
{
states_fxp[k][0]= fxp_double_to_fxp(_controller_fxp.states[k][0]);
}
fxp_matrix_multiplication(nOutputs,nStates,nStates,1,K_fxp,states_fxp,result_fxp);
fxp_t reference_fxp[4][4];
fxp_t result_fxp2[4][4];
for(k=0;k<nInputs;k++)
{
reference_fxp[k][0] =fxp_double_to_fxp(fxp_quantize(reference_aux[k][0]));
}
fxp_sub_matrix(nInputs,1, reference_fxp, result_fxp, result_fxp2);
for(k=0; k<nInputs;k++)
{
_controller_fxp.inputs[k][0] = fxp_to_double(fxp_quantize(result_fxp2[k][0]));
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller_fxp.C,_controller_fxp.states,result1);
if(flag == 1)
{
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller_fxp.D,_controller_fxp.inputs,result2);
}
double_add_matrix(nOutputs,1,result1,result2,_controller_fxp.outputs);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller_fxp.A,_controller_fxp.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller_fxp.B,_controller_fxp.inputs,result2);
double_add_matrix(nStates,1,result1,result2,_controller_fxp.states);
return _controller_fxp.outputs[0][0];
}
double ss_closed_loop_quantization_error(double reference){
double reference_aux[4][4];
double result1[4][4];
double result2[4][4];
unsigned int i;
unsigned int j;
short unsigned int flag = 0;
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
if(_controller_double.D[i][j] != 0){
flag = 1;
}
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
reference_aux[i][j]= reference;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller_double.K,_controller_double.states,result1);
double_sub_matrix(nInputs,1,reference_aux,result1, _controller_double.inputs);
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller_double.C,_controller_double.states,result1);
if(flag == 1)
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller_double.D,_controller_double.inputs,result2);
double_add_matrix(nOutputs,1,result1,result2,_controller_double.outputs);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller_double.A,_controller_double.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller_double.B,_controller_double.inputs,result2);
double_add_matrix(nStates,1,result1,result2,_controller_double.states);
return _controller_double.outputs[0][0];
}
int verify_error_state_space(void){
int i,j;
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_state[i][j]= (_controller.states[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<1;j++){
new_stateFWL[i][j]= (_controller.states[i][j]);
}
}
_controller_fxp = _controller;
_controller_double = _controller;
overflow_mode = 0;
fxp_t x[0];
fxp_t min_fxp = fxp_double_to_fxp(impl.min);
fxp_t max_fxp = fxp_double_to_fxp(impl.max);
double nondet_constant_input = nondet_double();
__DSVERIFIER_assume(nondet_constant_input >= min_fxp && nondet_constant_input <= max_fxp);
for (i = 0; i < 0; ++i) {
x[i] = nondet_constant_input;
}
double __quant_error;
if(closed_loop){
for (i = 0; i < 0; ++i) {
__quant_error = ss_closed_loop_quantization_error(x[i]) - fxp_ss_closed_loop_quantization_error(x[i]);
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
((void) sizeof ((
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ; else __assert_fail (
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
"__quant_error < error_limit && __quant_error > ((-1)*error_limit)"
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h", 354, __extension__ __PRETTY_FUNCTION__); }))
# 354 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
;
}
}
else {
for (i=0; i < 0; i++)
{
__quant_error = ss_system_quantization_error(x[i]);
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
((void) sizeof ((
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
__quant_error < error_limit && __quant_error > ((-1)*error_limit)
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
) ; else __assert_fail (
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
"__quant_error < error_limit && __quant_error > ((-1)*error_limit)"
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h", 361, __extension__ __PRETTY_FUNCTION__); }))
# 361 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_error_state_space.h"
;
}
}
return 0;
}
# 44 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
extern digital_system_state_space _controller;
extern double error_limit;
extern int closed_loop;
double fxp_ss_closed_loop_safety(){
double reference[4][4];
double result1[4][4];
double result2[4][4];
fxp_t K_fpx[4][4];
fxp_t outputs_fpx[4][4];
fxp_t result_fxp[4][4];
unsigned int i;
unsigned int j;
unsigned int k;
short unsigned int flag = 0;
for(i=0; i<nOutputs;i++){
for(j=0; j<nInputs;j++){
if(_controller.D[i][j] != 0){
flag = 1;
}
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<1;j++){
reference[i][j]= (_controller.inputs[i][j]);
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<nOutputs;j++){
K_fpx[i][j]=0;
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<1;j++){
outputs_fpx[i][j]=0;
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result_fxp[i][j]=0;
}
}
for(i=0; i<nInputs;i++){
for(j=0; j<nOutputs;j++){
K_fpx[i][j]= fxp_double_to_fxp(_controller.K[i][j]);
}
}
for(i=0; i<4;i++){
for(j=0; j<4;j++){
result1[i][j]=0;
result2[i][j]=0;
}
}
for (i = 1; i < 0; i++) {
double_matrix_multiplication(nOutputs,nStates,nStates,1,_controller.C,_controller.states,result1);
if(flag == 1){
double_matrix_multiplication(nOutputs,nInputs,nInputs,1,_controller.D,_controller.inputs,result2);
}
double_add_matrix(nOutputs,
1,
result1,
result2,
_controller.outputs);
for(k=0; k<nOutputs;k++){
for(j=0; j<1;j++){
outputs_fpx[k][j]= fxp_double_to_fxp(_controller.outputs[k][j]);
}
}
fxp_matrix_multiplication(nInputs,nOutputs,nOutputs,1,K_fpx,outputs_fpx,result_fxp);
for(k=0; k<nInputs;k++){
for(j=0; j<1;j++){
result1[k][j]= fxp_to_double(result_fxp[k][j]);
}
}
printf("### fxp: U (before) = %.9f", _controller.inputs[0][0]);
printf("### fxp: reference = %.9f", reference[0][0]);
printf("### fxp: result1 = %.9f", result1[0][0]);
printf("### fxp: reference - result1 = %.9f", (reference[0][0] - result1[0][0]));
double_sub_matrix(nInputs,
1,
reference,
result1,
_controller.inputs);
printf("### fxp: Y = %.9f", _controller.outputs[0][0]);
printf("### fxp: U (after) = %.9f \n### \n### ", _controller.inputs[0][0]);
double_matrix_multiplication(nStates,nStates,nStates,1,_controller.A,_controller.states,result1);
double_matrix_multiplication(nStates,nInputs,nInputs,1,_controller.B,_controller.inputs,result2);
double_add_matrix(nStates,
1,
result1,
result2,
_controller.states);
}
return _controller.outputs[0][0];
}
int verify_safety_state_space(void){
fxp_t output_fxp = fxp_ss_closed_loop_safety();
double output_double = fxp_to_double(output_fxp);
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
((void) sizeof ((
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
output_double <= error_limit
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
output_double <= error_limit
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
) ; else __assert_fail (
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
"output_double <= error_limit"
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h", 140, __extension__ __PRETTY_FUNCTION__); }))
# 140 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_safety_state_space.h"
;
return 0;
}
# 45 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 1
# 14 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
extern digital_system_state_space _controller;
int verify_controllability(void){
int i;
int j;
fxp_t A_fpx[4][4];
fxp_t B_fpx[4][4];
fxp_t controllabilityMatrix[4][4];
fxp_t backup[4][4];
fxp_t backupSecond[4][4];
double controllabilityMatrix_double[4][4];
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nInputs);j++){
A_fpx[i][j] = 0.0;
B_fpx[i][j] = 0.0;
controllabilityMatrix[i][j] = 0.0;
backup[i][j] = 0.0;
backupSecond[i][j] = 0.0;
controllabilityMatrix_double[i][j] = 0.0;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
A_fpx[i][j]= fxp_double_to_fxp(_controller.A[i][j]);
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nInputs;j++){
B_fpx[i][j]= fxp_double_to_fxp(_controller.B[i][j]);
}
}
if(nInputs > 1){
int l = 0;
for(j=0; j<(nStates*nInputs);){
fxp_exp_matrix(nStates,nStates,A_fpx,l,backup);
l++;
fxp_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,B_fpx,backupSecond);
for(int k = 0; k < nInputs; k++){
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][k];
}
j++;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nInputs);j++){
backup[i][j]= 0.0;
}
}
fxp_transpose(controllabilityMatrix,backup,nStates,(nStates*nInputs));
fxp_t mimo_controllabilityMatrix_fxp[4][4];
fxp_matrix_multiplication(nStates,(nStates*nInputs),(nStates*nInputs),nStates,controllabilityMatrix,backup,mimo_controllabilityMatrix_fxp);
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
controllabilityMatrix_double[i][j]= fxp_to_double(mimo_controllabilityMatrix_fxp[i][j]);
}
}
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(controllabilityMatrix_double,nStates) != 0"
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 91, __extension__ __PRETTY_FUNCTION__); }))
# 91 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
} else {
for(j=0; j<nStates;j++){
fxp_exp_matrix(nStates,nStates,A_fpx,j,backup);
fxp_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,B_fpx,backupSecond);
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][0];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
controllabilityMatrix_double[i][j]= fxp_to_double(controllabilityMatrix[i][j]);
}
}
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix_double,nStates) != 0
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(controllabilityMatrix_double,nStates) != 0"
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 113, __extension__ __PRETTY_FUNCTION__); }))
# 113 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
}
return 0;
}
int verify_controllability_double(void){
int i;
int j;
double controllabilityMatrix[4][4];
double backup[4][4];
double backupSecond[4][4];
double controllabilityMatrix_double[4][4];
if(nInputs > 1){
int l = 0;
for(j=0; j<(nStates*nInputs);){
double_exp_matrix(nStates,nStates,_controller.A,l,backup);
l++;
double_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,_controller.B,backupSecond);
for(int k = 0; k < nInputs; k++){
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][k];
}
j++;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nInputs);j++){
backup[i][j]= 0.0;
}
}
transpose(controllabilityMatrix,backup,nStates,(nStates*nInputs));
double mimo_controllabilityMatrix_double[4][4];
double_matrix_multiplication(nStates,(nStates*nInputs),(nStates*nInputs),nStates,controllabilityMatrix,backup,mimo_controllabilityMatrix_double);
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(mimo_controllabilityMatrix_double,nStates) != 0
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(mimo_controllabilityMatrix_double,nStates) != 0
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(mimo_controllabilityMatrix_double,nStates) != 0"
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 154, __extension__ __PRETTY_FUNCTION__); }))
# 154 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
} else {
for(j=0; j<nStates;j++){
double_exp_matrix(nStates,nStates,_controller.A,j,backup);
double_matrix_multiplication(nStates,nStates,nStates,nInputs,backup,_controller.B,backupSecond);
for(i = 0; i<nStates;i++){
controllabilityMatrix[i][j]= backupSecond[i][0];
}
}
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
((void) sizeof ((
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix,nStates) != 0
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
determinant(controllabilityMatrix,nStates) != 0
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
) ; else __assert_fail (
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
"determinant(controllabilityMatrix,nStates) != 0"
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h", 163, __extension__ __PRETTY_FUNCTION__); }))
# 163 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_controllability.h"
;
}
return 0;
}
# 46 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 1
# 17 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
extern digital_system_state_space _controller;
int verify_observability(void){
int i;
int j;
fxp_t A_fpx[4][4];
fxp_t C_fpx[4][4];
fxp_t observabilityMatrix[4][4];
fxp_t backup[4][4];
fxp_t backupSecond[4][4];
double observabilityMatrix_double[4][4];
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
observabilityMatrix[i][j]= 0;
A_fpx[i][j]=0;
C_fpx[i][j]= 0;
backup[i][j]= 0;
backupSecond[i][j]= 0;
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
A_fpx[i][j]= fxp_double_to_fxp(_controller.A[i][j]);
}
}
for(i=0; i<nOutputs;i++){
for(j=0; j<nStates;j++){
C_fpx[i][j]= fxp_double_to_fxp(_controller.C[i][j]);
}
}
if(nOutputs > 1){
int l;
j = 0;
for(l=0; l<nStates;){
fxp_exp_matrix(nStates,nStates,A_fpx,l,backup);
l++;
fxp_matrix_multiplication(nOutputs,nStates,nStates,nStates,C_fpx,backup,backupSecond);
for(int k = 0; k < nOutputs; k++){
for(i = 0; i<nStates;i++){
observabilityMatrix[j][i]= backupSecond[k][i];
}
j++;
}
}
# 80 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
for(i=0; i<nStates;i++){
for(j=0; j<(nStates*nOutputs);j++){
backup[i][j]= 0.0;
}
}
fxp_transpose(observabilityMatrix,backup,(nStates*nOutputs),nStates);
# 99 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
fxp_t mimo_observabilityMatrix_fxp[4][4];
fxp_matrix_multiplication(nStates,(nStates*nOutputs),(nStates*nOutputs),nStates,backup,observabilityMatrix,mimo_observabilityMatrix_fxp);
# 112 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
observabilityMatrix_double[i][j]= fxp_to_double(mimo_observabilityMatrix_fxp[i][j]);
}
}
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
((void) sizeof ((
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ; else __assert_fail (
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
"determinant(observabilityMatrix_double,nStates) != 0"
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h", 119, __extension__ __PRETTY_FUNCTION__); }))
# 119 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
;
}else{
for(i=0; i<nStates;i++){
fxp_exp_matrix(nStates,nStates,A_fpx,i,backup);
fxp_matrix_multiplication(nOutputs,nStates,nStates,nStates,C_fpx,backup,backupSecond);
for(j = 0; j<nStates;j++){
observabilityMatrix[i][j]= backupSecond[0][j];
}
}
for(i=0; i<nStates;i++){
for(j=0; j<nStates;j++){
observabilityMatrix_double[i][j]= fxp_to_double(observabilityMatrix[i][j]);
}
}
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
((void) sizeof ((
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ? 1 : 0), __extension__ ({ if (
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
determinant(observabilityMatrix_double,nStates) != 0
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
) ; else __assert_fail (
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
"determinant(observabilityMatrix_double,nStates) != 0"
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h" 3 4
, "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h", 134, __extension__ __PRETTY_FUNCTION__); }))
# 134 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_observability.h"
;
}
return 0;
}
# 47 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
# 1 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_magnitude.h" 1
# 16 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_magnitude.h"
extern filter_parameters filter;
extern implementation impl;
extern digital_system ds;
# 28 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/engine/verify_magnitude.h"
void resp_mag(double* num, int lnum, double* den, int lden, double* res, int N) {
double w;
int m, i;
double out_numRe[N + 1];
double out_numIm[N + 1];
double out_denRe[N + 1];
double out_denIm[N + 1];
double old_out_Re;
double zero_test;
for (w = 0, i = 0; w <= 3.14159265358979323846; w += 3.14159265358979323846 / N, ++i) {
out_numRe[i] = num[0];
out_numIm[i] = 0;
for (m = 1; m < lnum; ++m) {
old_out_Re = out_numRe[i];
out_numRe[i] = cosTyl(w, 6) * out_numRe[i] - sinTyl(w, 6) * out_numIm[i] + num[m];
out_numIm[i] = sinTyl(w, 6) * old_out_Re + cosTyl(w, 6) * out_numIm[i];
}
out_denRe[i] = den[0];
out_denIm[i] = 0;
for (m = 1; m < lden; ++m) {
old_out_Re = out_denRe[i];
out_denRe[i] = cosTyl(w, 6) * out_denRe[i] - sinTyl(w, 6) * out_denIm[i] + den[m];
out_denIm[i] = sinTyl(w, 6) * old_out_Re + cosTyl(w, 6) * out_denIm[i];
}
res[i] = sqrt3(out_numRe[i] * out_numRe[i] + out_numIm[i] * out_numIm[i]);
zero_test = sqrt3(out_denRe[i] * out_denRe[i] + out_denIm[i] * out_denIm[i]);
__DSVERIFIER_assume(zero_test != 0);
res[i] = res[i] / zero_test;
}
}
int verify_magnitude(void) {
int freq_response_samples = 100;
double w;
double w_incr = 1.0 / freq_response_samples;
double res[freq_response_samples+1];
int i,j;
fxp_t a_fxp[ds.a_size];
fxp_double_to_fxp_array(ds.a, a_fxp, ds.a_size);
double _a[ds.a_size];
fxp_to_double_array(_a, a_fxp, ds.a_size);
fxp_t b_fxp[ds.b_size];
fxp_double_to_fxp_array(ds.b, b_fxp, ds.b_size);
double _b[ds.b_size];
fxp_to_double_array(_b, b_fxp, ds.b_size);
resp_mag(ds.b, ds.b_size, ds.a, ds.a_size, res, freq_response_samples);
if (filter.type == 1) {
for (i = 0, w = 0; (w <= 1.0); ++i, w += w_incr) {
if (w <= filter.wp) {
__DSVERIFIER_assert_msg(res[i] >= filter.Ap, "|----------------Passband Failure-------------|");
} else if (w == filter.wc) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ac, "|-------------Cutoff Frequency Failure--------|");
} else if ((w >= filter.wr) && (w <= 1)) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ar, "|----------------Stopband Failure-------------|");
}
}
} else if (filter.type == 2) {
for (i = 0, w = 0; (w <= 1.0); ++i, w += w_incr) {
if (w <= filter.wr) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ar, "|----------------Stopband Failure-------------|");
} else if (w == filter.wc) {
__DSVERIFIER_assert_msg(res[i] <= filter.Ac, "|-------------Cutoff Frequency Failure--------|");
} else if ((w > filter.wp) && (w <= 1)) {
__DSVERIFIER_assert_msg(res[i] >= filter.Ap, "|----------------Passband Failure-------------|");
}
}
} else {
__DSVERIFIER_assert(0);
}
return 0;
}
# 48 "/home/yashchopda/Desktop/dsverifier-v2.0.3-esbmc-v4.0-cbmc-5.6/bmc/dsverifier.h" 2
extern digital_system ds;
extern digital_system plant;
digital_system plant_cbmc;
extern digital_system controller;
extern implementation impl;
extern hardware hw;
extern digital_system_state_space _controller;
extern filter_parameters filter;
unsigned int nondet_uint();
extern void initials();
void validation();
void call_verification_task(void * verification_task);
void call_closedloop_verification_task(void * closedloop_verification_task);
float nondet_float();
double nondet_double();
int main(){
initialization();
validation();
if (1 == 0)
rounding_mode = 0;
else if (1 == 1)
rounding_mode = 1;
else if (1 == 2)
rounding_mode = 2;
if (3 == 3)
{
call_verification_task(&verify_overflow);
}
else if (3 == 2)
{
call_verification_task(&verify_limit_cycle);
}
else if (3 == 6)
{
call_verification_task(&verify_error);
}
else if (3 == 1)
{
call_verification_task(&verify_zero_input_limit_cycle);
}
else if (3 == 4)
{
call_verification_task(&verify_timing_msp_430);
}
else if (3 == 5)
{
call_verification_task(&verify_generic_timing);
}
else if (3 == 7)
{
call_verification_task(&verify_stability);
}
else if (3 == 8)
{
call_verification_task(&verify_minimum_phase);
}
else if (3 == 9)
{
call_closedloop_verification_task(&verify_stability_closedloop_using_dslib);
}
else if (3 == 10)
{
call_closedloop_verification_task(&verify_limit_cycle_closed_loop);
}
else if (3 == 11)
{
call_closedloop_verification_task(&verify_error_closedloop);
}
else if (3 == 12)
{
verify_error_state_space();
}
else if (3 == 16)
{
verify_safety_state_space();
}
else if (3 == 13)
{
verify_controllability();
}
else if (3 == 14)
{
verify_observability();
}
else if (3 == 15)
{
verify_limit_cycle_state_space();
}
else if (3 == 18)
{
call_verification_task(&verify_magnitude);
}
return 0;
}
void validation()
{
if (3 == 12 || 3 == 16 ||
3 == 15 || 3 == 13 ||
3 == 14)
{
if (0 == 0)
{
printf("\n\n********************************************************************************************\n");
printf("* set a K_SIZE to use this property in DSVerifier (use: -DK_SIZE=VALUE) *\n");
printf("********************************************************************************************\n");
__DSVERIFIER_assert(0);
exit(1);
}
initials();
return;
}
if (((3 != 9) && (3 != 10) &&
(3 != 11)) && (ds.a_size == 0 || ds.b_size == 0))
{
printf("\n\n****************************************************************************\n");
printf("* set (ds and impl) parameters to check with DSVerifier *\n");
printf("****************************************************************************\n");
__DSVERIFIER_assert(0);
}
if ((3 == 9) || (3 == 10) ||
(3 == 11))
{
if (controller.a_size == 0 || plant.b_size == 0 || impl.int_bits == 0 )
{
printf("\n\n*****************************************************************************************************\n");
printf("* set (controller, plant, and impl) parameters to check CLOSED LOOP with DSVerifier *\n");
printf("*****************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
else
{
printf("\n\n*****************************************************************************************************\n");
printf("* set (controller and impl) parameters so that they do not overflow *\n");
printf("*****************************************************************************************************\n");
unsigned j;
for (j = 0; j < controller.a_size; ++j)
{
const double value=controller.a[j];
__DSVERIFIER_assert(value <= _dbl_max);
__DSVERIFIER_assert(value >= _dbl_min);
}
for (j = 0; j < controller.b_size; ++j)
{
const double value=controller.b[j];
__DSVERIFIER_assert(value <= _dbl_max);
__DSVERIFIER_assert(value >= _dbl_min);
}
}
if (controller.b_size > 0)
{
unsigned j, zeros=0;
for (j = 0; j < controller.b_size; ++j)
{
if (controller.b[j]==0)
++zeros;
}
if (zeros == controller.b_size)
{
printf("\n\n*****************************************************************************************************\n");
printf("* The controller numerator must not be zero *\n");
printf("*****************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (controller.a_size > 0)
{
unsigned j, zeros=0;
for (j = 0; j < controller.a_size; ++j)
{
if (controller.a[j]==0)
++zeros;
}
if (zeros == controller.a_size)
{
printf("\n\n*****************************************************************************************************\n");
printf("* The controller denominator must not be zero *\n");
printf("*****************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (0 == 0)
{
printf("\n\n***************************************************************************************************************\n");
printf("* set a connection mode to check CLOSED LOOP with DSVerifier (use: --connection-mode TYPE) *\n");
printf("***************************************************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (3 == 0)
{
printf("\n\n***************************************************************************************\n");
printf("* set the property to check with DSVerifier (use: --property NAME) *\n");
printf("***************************************************************************************\n");
__DSVERIFIER_assert(0);
}
if ((3 == 3) || (3 == 2) || (3 == 1) ||
(3 == 10) || (3 == 11) ||
(3 == 4 || 3 == 5) || 3 == 6)
{
if ((10 == 0) && !(0 == 1))
{
printf("\n\n********************************************************************************************\n");
printf("* set a X_SIZE to use this property in DSVerifier (use: --x-size VALUE) *\n");
printf("********************************************************************************************\n");
__DSVERIFIER_assert(0);
}
else if (0 == 1)
{
X_SIZE_VALUE = nondet_uint();
__DSVERIFIER_assume( X_SIZE_VALUE > (2 * ds.a_size));
}
else if (10 < 0)
{
printf("\n\n********************************************************************************************\n");
printf("* set a X_SIZE > 0 *\n");
printf("********************************************************************************************\n");
__DSVERIFIER_assert(0);
}
else
{
X_SIZE_VALUE = 10;
}
}
if ((1 == 0) && (3 != 9) && (3 != 18))
{
printf("\n\n*********************************************************************************************\n");
printf("* set the realization to check with DSVerifier (use: --realization NAME) *\n");
printf("*********************************************************************************************\n");
__DSVERIFIER_assert(0);
}
if (3 == 6 || 3 == 11)
{
if (impl.max_error == 0)
{
printf("\n\n***********************************************************************\n");
printf("* provide the maximum expected error (use: impl.max_error) *\n");
printf("***********************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if (3 == 4 || 3 == 5)
{
if (3 == 5 || 3 == 4)
{
if (hw.clock == 0l)
{
printf("\n\n***************************\n");
printf("* Clock could not be zero *\n");
printf("***************************\n");
__DSVERIFIER_assert(0);
}
hw.cycle = ((double) 1.0 / hw.clock);
if (hw.cycle < 0)
{
printf("\n\n*********************************************\n");
printf("* The cycle time could not be representable *\n");
printf("*********************************************\n");
__DSVERIFIER_assert(0);
}
if (ds.sample_time == 0)
{
printf("\n\n*****************************************************************************\n");
printf("* provide the sample time of the digital system (ds.sample_time) *\n");
printf("*****************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
}
if (3 == 18)
{
if (!((filter.Ap > 0) && (filter.Ac >0) && (filter.Ar >0)))
{
printf("\n\n*****************************************************************************\n");
printf("* set values bigger than 0 for Ap, Ac and Ar* \n");
printf("*****************************************************************************\n");
__DSVERIFIER_assert(0);
}
}
if ((1 == 7) || (1 == 8) || (1 == 9) ||
(1 == 10) || (1 == 11) || (1 == 12))
{
printf("\n\n******************************************\n");
printf("* Temporarily the cascade modes are disabled *\n");
printf("**********************************************\n");
__DSVERIFIER_assert(0);
}
}
void call_verification_task(void * verification_task)
{
int i = 0;
_Bool base_case_executed = 0;
if (0 == 2)
{
for(i=0; i<ds.b_size; i++)
{
if (ds.b_uncertainty[i] > 0)
{
double factor = ds.b_uncertainty[i];
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.b[i] - factor;
double max = ds.b[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.b[i] = nondet_double();
__DSVERIFIER_assume((ds.b[i] >= min) && (ds.b[i] <= max));
}
}
for(i=0; i<ds.a_size; i++)
{
if (ds.a_uncertainty[i] > 0)
{
double factor = ds.a_uncertainty[i];
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.a[i] - factor;
double max = ds.a[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.a[i] = nondet_double();
__DSVERIFIER_assume((ds.a[i] >= min) && (ds.a[i] <= max));
}
}
}
else
{
int i=0;
for(i=0; i<ds.b_size; i++)
{
if (ds.b_uncertainty[i] > 0)
{
double factor = ((ds.b[i] * ds.b_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.b[i] - factor;
double max = ds.b[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.b[i] = nondet_double();
__DSVERIFIER_assume((ds.b[i] >= min) && (ds.b[i] <= max));
}
}
for(i=0; i<ds.a_size; i++)
{
if (ds.a_uncertainty[i] > 0)
{
double factor = ((ds.a[i] * ds.a_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = ds.a[i] - factor;
double max = ds.a[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
ds.a[i] = nondet_double();
__DSVERIFIER_assume((ds.a[i] >= min) && (ds.a[i] <= max));
}
}
}
((void(*)())verification_task)();
}
void call_closedloop_verification_task(void * closedloop_verification_task)
{
_Bool base_case_executed = 0;
int i=0;
for(i=0; i<plant.b_size; i++)
{
if (plant.b_uncertainty[i] > 0)
{
double factor = ((plant.b[i] * plant.b_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = plant.b[i] - factor;
double max = plant.b[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
plant.b[i] = nondet_double();
__DSVERIFIER_assume((plant.b[i] >= min) && (plant.b[i] <= max));
}else{
}
}
for(i=0; i<plant.a_size; i++)
{
if (plant.a_uncertainty[i] > 0)
{
double factor = ((plant.a[i] * plant.a_uncertainty[i]) / 100);
factor = factor < 0 ? factor * (-1) : factor;
double min = plant.a[i] - factor;
double max = plant.a[i] + factor;
if ((factor == 0) && (base_case_executed == 1))
{
continue;
}
else if ((factor == 0) && (base_case_executed == 0))
{
base_case_executed = 1;
}
plant.a[i] = nondet_double();
__DSVERIFIER_assume((plant.a[i] >= min) && (plant.a[i] <= max));
}
else
{
}
}
((void(*)())closedloop_verification_task)();
}
# 2 "benchmarks/ds-01-impl3.c" 2
digital_system ds = {
.b = { 1.5, -0.5 },
.b_size = 2,
.a = { 1.0, 0.0 },
.a_size = 2,
.sample_time = 0.02
};
implementation impl = {
.int_bits = 6,
.frac_bits = 10,
.max = 1.0,
.min = -1.0,
};
|
the_stack_data/505950.c | // xbly.c converts from XBLY on stdin to XML on stdout
// COMPILE: cc -std=c99 -Wall -Wextra xbly.c -o xbly
// USAGE: echo "(foo (bar))" | ./xbly
// EXIT CODE: zero on success
// SPDX-License-Identifier: MIT-0
/*
XBLY.c
Copyright © 2020 Tawesoft Ltd <[email protected]>
Copyright © 2020 Ben Golightly <[email protected]>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include <ctype.h> // isspace
#include <stdio.h> // fgetc, fputc, etc.
#include <stdlib.h> // exit
#include <limits.h> // CHAR_MAX
#define whitespace(x) (isspace(x) != 0)
// Parser states. Illustrated by example: consider the string:
// `<?xml version="1.0)?>(parent \enabled \fruit="apple" (child some text \(hi!\)))`
enum estate {
ParsingStart, // <?xml version="1.0)?>
ParsingElementName, // `parent` and `child`
ParsingAttributes, // `\enabled \fruit="apple"`
ParsingAttribute, // `\enabled` and `\fruit="apple"`
ParsingAttributeValue, // `"apple"`
ParsingText, // `some text \(hi!\)`
ParsingTextEscaped, // `\(` and `\)` in `some text \(hi!\)`
};
enum estate state = ParsingStart;
// A stack of element names. Each name is terminated by a single byte
// indicating its length.
#define NAMESTACKZ (16*1024)
char nameStack[NAMESTACKZ];
int nameStackTop = 0;
int nameLen = 0;
// push a character or length on to the stack
void push(int a) {
if (nameLen >= CHAR_MAX) {
fprintf(stderr, "element name too long\n");
exit(1);
}
if (nameStackTop >= NAMESTACKZ) {
fprintf(stderr, "stack overflow\n");
exit(1);
}
nameLen++;
nameStack[nameStackTop] = (char) a;
nameStackTop++;
}
// pop and print a name from the stack
void pop_name() {
if (nameStackTop <= 0) {
fprintf(stderr, "stack underflow\n");
exit(1);
}
fputc('<', stdout);
fputc('/', stdout);
int len = (int) nameStack[nameStackTop - 1];
for (int i = nameStackTop - len - 1; i < nameStackTop - 1; i++) {
fputc(nameStack[i], stdout);
}
nameStackTop = nameStackTop - len - 1;
fputc('>', stdout);
}
// discard the top name from the stack
void discard_name() {
if (nameStackTop <= 0) {
fprintf(stderr, "stack underflow\n");
exit(1);
}
int len = (int) nameStack[nameStackTop - 1];
nameStackTop = nameStackTop - len - 1;
}
void start_element_name() {
fputc('<', stdout);
state = ParsingElementName;
nameLen = 0;
}
int main(void) {
int current = EOF;
int next = fgetc(stdin);
int seenQuote = 0; // zero, ' or "
while (next != EOF) {
current = next;
next = fgetc(stdin);
switch (state) {
case ParsingStart:
// Anything up to the first opening parenthesis is copied
// verbatim.
if (current == '(') {
start_element_name();
} else {
fputc(current, stdout);
}
break;
case ParsingElementName:
// Copy the element name, storing its name on the stack until:
//
// - whitespace marks the end of the element name and attribute
// processing starts (attributes may be empty) e.g. `(p foo)`
// or `(br )` or `(p \class="foo" ...`.
//
// - a closing parenthesis immediately closes the element e.g.
// `(br)`, at which point the element is an Empty-element Tag
// and can be closed immediately as e.g. `<br/>`.
if (whitespace(current)) {
fputc(current, stdout);
push(nameLen);
state = ParsingAttributes;
} else if (current == ')') {
push(nameLen);
discard_name();
fputs(" />", stdout);
state = ParsingText;
} else {
fputc(current, stdout);
push(current);
}
break;
case ParsingAttributes:
// Parse attributes starting with backslash plus any character
// other than backslash, open or close parenthesis.
// e.g. (p \class="foo" \class="bar" ...)
//
// Or, open a new element e.g. `(a \class="foo" (b ...))`
// ----------------^
//
// Or, close close the current element e.g. `(a \class="foo")`
// ---------------^
// immediately without finding any text or child elements
//
// Or, find some text content e.g. `(a \class="foo" Hello)`
// ----------------^
if (current == '(') {
fputc('>', stdout);
start_element_name();
} else if (current == ')') {
discard_name();
fputs(" />", stdout);
state = ParsingText;
} else if (whitespace(current)) {
fputc(current, stdout);
} else if (current == '\\') {
if ((next == '\\') || (next == '(') || (next == ')')) {
fputc('>', stdout);
fputc(current, stdout);
state = ParsingText;
} else if (whitespace(next)) {
fputc('>', stdout);
state = ParsingText;
} else {
state = ParsingAttribute;
}
} else {
fputc('>', stdout);
fputc(current, stdout);
state = ParsingText;
}
break;
case ParsingAttribute:
// Parse a single attribute e.g. `\foo="bar"`, returning to
// attributes parsing mode on completion.
//
// Single or double quotes are fine.
fputc(current, stdout);
if (current == '=') {
state = ParsingAttributeValue;
seenQuote = 0;
} else if (current == ' ') {
// tolerate invalid XML such as <foo enabled>
state = ParsingAttributes;
}
break;
case ParsingAttributeValue:
// Parse a single attribute value e.g. "foo"
fputc(current, stdout);
if (seenQuote) {
if (current == seenQuote) {
// matching end quote, so we're done
state = ParsingAttributes;
}
} else {
if ((current == '"') || (current == '\'')) {
// found the starting quote
seenQuote = current;
}
}
break;
case ParsingText:
// Parse text content
// - starting a new element on open parenthesis
// - closing the current element on close parenthesis,
// - escaping the next character on backslash
if (current == '<') {
fputs("<", stdout);
} else if (current == '>') {
fputs(">", stdout);
} else if (current == '(') {
start_element_name();
} else if (current == ')') {
pop_name();
} else if (current == '\\') {
state = ParsingTextEscaped;
} else {
fputc(current, stdout);
}
break;
case ParsingTextEscaped:
if ((current == '(') || (current == ')') || (current == '\\') || (whitespace(current))) {
fputc(current, stdout);
state = ParsingText;
} else {
fprintf(stderr, "illegal escape sequence\n");
return -1;
}
break;
}
}
if (nameStackTop) {
fprintf(stderr, "unexpected EOF\n");
return -1;
}
return ferror(stdin) ? ferror(stdin) : ferror(stdout);
}
|
the_stack_data/22013456.c | #include <stdio.h>
int main()
{
int num;
scanf("%i", &num);
printf("%i\n", (num % 10));
//printf("%i\n", ((num % 10) * (-1)));
return(0);
}
|
the_stack_data/93888058.c | /* This testcase is part of GDB, the GNU debugger.
Copyright 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <signal.h>
#include <unistd.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#ifdef USE_THREADS
#include <pthread.h>
#endif
void action(int sig, siginfo_t * info, void *uc)
{
raise (SIGALRM);
}
static void *func (void *arg)
{
struct sigaction act;
memset (&act, 0, sizeof(struct sigaction));
act.sa_sigaction = action;
act.sa_flags = SA_RESTART;
sigaction (SIGALRM, &act, 0);
raise (SIGALRM);
/* We must not get past this point, either in a free standing or debugged
state. */
abort ();
/* NOTREACHED */
return NULL;
}
int main ()
{
#ifndef USE_THREADS
func (NULL);
#else
pthread_t th;
pthread_create (&th, NULL, func, NULL);
pthread_join (th, NULL);
#endif
return 0;
}
|
the_stack_data/167329789.c | /* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_swap.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: atrouill <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/08/01 11:53:55 by atrouill #+# #+# */
/* Updated: 2019/08/01 11:56:33 by atrouill ### ########.fr */
/* */
/* ************************************************************************** */
void ft_swap(int *a, int *b)
{
int tmp;
tmp = *b;
*b = *a;
*a = tmp;
}
|
the_stack_data/548907.c | /*
Searching algorithms
Copyright 2016, Sjors van Gelderen
*/
#include <stdlib.h>
#include <stdio.h>
/*
Function prototypes
*/
int print_array(int _n, int _array[_n]);
int linear_search(int _n, int _array[_n], int _target);
int binary_search();
/*
Prints an array
*/
int print_array(int _n, int _array[_n])
{
int i;
if(_n <= 0)
{
printf("Array is of invalid length!\n");
return EXIT_FAILURE;
}
printf("[");
for(i = 0; i < _n; i++)
{
if(i < _n -1)
{
printf("%d, ", _array[i]);
}
else
{
printf("%d", _array[i]);
}
}
printf("]");
return EXIT_SUCCESS;
}
/*
Linear search algorithm
Complexity: O(n)
*/
int linear_search(int _n, int _array[_n], int _target)
{
int i;
if(_n <= 0)
{
printf("Array is of invalid length!\n");
return EXIT_FAILURE;
}
printf("Linear search example on ");
print_array(_n, _array);
printf("\n");
for(i = 0; i < _n; i++)
{
if(_array[i] == _target)
{
printf("Found target at index %d!\n", i);
return EXIT_SUCCESS;
}
}
printf("Array doesn't contain target!\n");
return EXIT_FAILURE;
}
/*
Binary search algorithm
Complexity: O(n log n)
*/
int binary_search()
{
return EXIT_SUCCESS;
}
/*
Main program logic
*/
int main()
{
int array[5] = {1, 3, 2, 7, 6};
linear_search(5, array, 7);
binary_search();
return EXIT_SUCCESS;
}
|
the_stack_data/48716.c | #include<stdio.h>
int main()
{
int a[50],i,j,n,t;
printf("Enter number of elements\n");
scanf("%d",&n);
printf("\nEnter the elements:\n ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
printf("Sorted array in ascending order\n");
for(i=0;i<n;i++)
{
printf("%d \t",a[i]);
}
printf("\n");
return 0;
}
|
the_stack_data/760117.c | // RUN: %clang_cc1 -triple x86_64-unknown-unknown -fopenmp -ast-dump %s | FileCheck --match-full-lines -implicit-check-not=openmp_structured_block %s
void test() {
#pragma omp target teams
;
}
// CHECK: TranslationUnitDecl {{.*}} <<invalid sloc>> <invalid sloc>
// CHECK: `-FunctionDecl {{.*}} <{{.*}}ast-dump-openmp-target-teams.c:3:1, line:6:1> line:3:6 test 'void ()'
// CHECK-NEXT: `-CompoundStmt {{.*}} <col:13, line:6:1>
// CHECK-NEXT: `-OMPTargetTeamsDirective {{.*}} <line:4:1, col:25>
// CHECK-NEXT: `-CapturedStmt {{.*}} <line:5:3>
// CHECK-NEXT: `-CapturedDecl {{.*}} <<invalid sloc>> <invalid sloc> nothrow
// CHECK-NEXT: |-CapturedStmt {{.*}} <col:3>
// CHECK-NEXT: | `-CapturedDecl {{.*}} <<invalid sloc>> <invalid sloc> nothrow
// CHECK-NEXT: | |-CapturedStmt {{.*}} <col:3>
// CHECK-NEXT: | | `-CapturedDecl {{.*}} <<invalid sloc>> <invalid sloc> nothrow
// CHECK-NEXT: | | |-NullStmt {{.*}} <col:3>
// CHECK-NEXT: | | |-ImplicitParamDecl {{.*}} <line:4:1> col:1 implicit .global_tid. 'const int *const restrict'
// CHECK-NEXT: | | |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .bound_tid. 'const int *const restrict'
// CHECK-NEXT: | | `-ImplicitParamDecl {{.*}} <col:1> col:1 implicit __context 'struct (unnamed at {{.*}}ast-dump-openmp-target-teams.c:4:1) *const restrict'
// CHECK-NEXT: | |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit __context 'struct (unnamed at {{.*}}ast-dump-openmp-target-teams.c:4:1) *const restrict'
// CHECK-NEXT: | |-RecordDecl {{.*}} <col:1> col:1 implicit struct definition
// CHECK-NEXT: | | `-CapturedRecordAttr {{.*}} <<invalid sloc>> Implicit
// CHECK-NEXT: | `-CapturedDecl {{.*}} <<invalid sloc>> <invalid sloc> nothrow
// CHECK-NEXT: | |-NullStmt {{.*}} <line:5:3>
// CHECK-NEXT: | |-ImplicitParamDecl {{.*}} <line:4:1> col:1 implicit .global_tid. 'const int *const restrict'
// CHECK-NEXT: | |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .bound_tid. 'const int *const restrict'
// CHECK-NEXT: | `-ImplicitParamDecl {{.*}} <col:1> col:1 implicit __context 'struct (unnamed at {{.*}}ast-dump-openmp-target-teams.c:4:1) *const restrict'
// CHECK-NEXT: |-AlwaysInlineAttr {{.*}} <<invalid sloc>> Implicit __forceinline
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .global_tid. 'const int'
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .part_id. 'const int *const restrict'
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .privates. 'void *const restrict'
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .copy_fn. 'void (*const restrict)(void *const restrict, ...)'
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .task_t. 'void *const'
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit __context 'struct (unnamed at {{.*}}ast-dump-openmp-target-teams.c:4:1) *const restrict'
// CHECK-NEXT: |-RecordDecl {{.*}} <col:1> col:1 implicit struct definition
// CHECK-NEXT: | `-CapturedRecordAttr {{.*}} <<invalid sloc>> Implicit
// CHECK-NEXT: `-CapturedDecl {{.*}} <<invalid sloc>> <invalid sloc> nothrow
// CHECK-NEXT: |-CapturedStmt {{.*}} <line:5:3>
// CHECK-NEXT: | `-CapturedDecl {{.*}} <<invalid sloc>> <invalid sloc> nothrow
// CHECK-NEXT: | |-NullStmt {{.*}} <col:3>
// CHECK-NEXT: | |-ImplicitParamDecl {{.*}} <line:4:1> col:1 implicit .global_tid. 'const int *const restrict'
// CHECK-NEXT: | |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .bound_tid. 'const int *const restrict'
// CHECK-NEXT: | `-ImplicitParamDecl {{.*}} <col:1> col:1 implicit __context 'struct (unnamed at {{.*}}ast-dump-openmp-target-teams.c:4:1) *const restrict'
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit __context 'struct (unnamed at {{.*}}ast-dump-openmp-target-teams.c:4:1) *const restrict'
// CHECK-NEXT: |-RecordDecl {{.*}} <col:1> col:1 implicit struct definition
// CHECK-NEXT: | `-CapturedRecordAttr {{.*}} <<invalid sloc>> Implicit
// CHECK-NEXT: `-CapturedDecl {{.*}} <<invalid sloc>> <invalid sloc> nothrow
// CHECK-NEXT: |-NullStmt {{.*}} <line:5:3>
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <line:4:1> col:1 implicit .global_tid. 'const int *const restrict'
// CHECK-NEXT: |-ImplicitParamDecl {{.*}} <col:1> col:1 implicit .bound_tid. 'const int *const restrict'
// CHECK-NEXT: `-ImplicitParamDecl {{.*}} <col:1> col:1 implicit __context 'struct (unnamed at {{.*}}ast-dump-openmp-target-teams.c:4:1) *const restrict'
|
the_stack_data/1191934.c | /**
* Exercitiul 3.
* Afisarea unor numere dupa un interval de timp.
*/
#include <stdio.h>
#include <time.h>
void wait(int seconds) {
clock_t endwait;
endwait = clock() + seconds * CLOCKS_PER_SEC;
while(clock() < endwait) {}
}
int main()
{
for (int i = 3; i >= 1; i--) {
printf("%d\n", i);
wait(1);
}
printf("START\n");
return 0;
} |
the_stack_data/669162.c | // File: codegen.c
// ---------------
// C examples that demo some interesting properties/transformations
// when C compiler generates ARM instructions.
// Part (a): arithmetic
// Study each function and the translation to ARM assembly.
// negate(): ARM has no negate instruction -- what is used instead?
// bitwise(): Note how constant expression is precomputed ("constant folding")
// Which ARM instruction is used for this bitwise operation?
// arithmetic(): The first statement generates 3 assembly instructions, yet
// second more complex line is just one. How/why does that happen?
int negate(int arg)
{
return -arg;
}
int bitwise(int arg)
{
return arg & ~((1 << 8) - 1);
}
int arithmetic(int arg)
{
int result = arg*22;
result = arg - (result + 3*result);
return result + 17;
}
// Part (b): if-else
// Branch instructions are used to make decisions about control flow.
// Look at the compiler's generated assembly for the code below.
// Which instruction evaluates the expression for the if?
// Which instruction set the condition codes? Which instruction reads
// the codes? How are branch instructions used to route execution?
// Compare the generated assembly for optimization level -Og to that
// for -O2? What is different?
int conditional(int arg)
{
int result = arg;
if (arg % 2 == 0) {
result++;
} else {
result--;
}
return result;
}
// Part (c): loops
// The function delay() is a C version of the delay loop we used in
// the blink program. If set to optimize at level -Og, the compiler's
// generated assembly is a close match to our hand-written assembly.
// But at -O2 (aggressive optimization) it's a different story!
// Add volatile qualifier to the declaration of variable count.
// How does the generated assembly change now?
void delay(void)
{
int count = 0x3f00;
while (--count != 0) ;
}
// The function wait_until_low() is a C version of
// "wait for button press" from lab1
// At -Og, the generated assembly repeatedly re-loads from LEV0
// and all is good. At -O2, it load once time and thereafter uses
// cached value in register.
// Is the proper fix to qualify `state` as volatile or `LEV0`?
// Try each one at a time to see the difference.
unsigned int *LEV0 = (unsigned int *)0x20200034;
void wait_until_low(void)
{
unsigned int state = *LEV0;
while (state & (1 << 10)) {
state = *LEV0;
}
}
// Part (d): pointers
// The function below accesses memory using pointer/array
// notation. The code is divided into pairs of statements
// which perform a similar operation, but have subtle differences
// (such as adding a typecast or operating on pointer of
// different pointee type). How do those differences affect
// the generated assembly?
int global;
void pointers(int n)
{
int *ptr = &global;
char *cptr = (char *)&global;
*ptr = 107; // compare to next line
*(char *)ptr = 55;
ptr[5] = 13; // compare to next line
cptr[5] = 13;
global = *(ptr + n); // compare to next line
global = ptr[n];
}
// Part (e): surprises
// precedence(): compiles to just return 7 -- why?
int precedence(int arg)
{
if (arg & 0x1 == 0) { // which precedence is higher: & vs. ==
return 5;
} else {
return 7;
}
}
// These last two exhibit "undefined behavior" (violates C language standard)
// C compiler does not reject outright, instead free to generate whatever asm
// not_initialized: declare a new variable but never initialize
// semi_initialize: what if only initialized on some paths
int not_initialized(int arg)
{
int result;
return result;
}
int semi_initialized(int arg)
{
int result;
if (arg > 0)
result = 5;
return result;
}
void main(void)
{
}
|
the_stack_data/18888115.c | /*
* MD5 hw acceleration
*******************************************************************************
* Copyright (c) 2017, STMicroelectronics
* SPDX-License-Identifier: Apache-2.0
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may
* not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#if defined(MBEDTLS_MD5_C)
#include "mbedtls/md5.h"
#if defined(MBEDTLS_MD5_ALT)
#include "mbedtls/platform.h"
/* Implementation that should never be optimized out by the compiler */
static void mbedtls_zeroize( void *v, size_t n ) {
volatile unsigned char *p = v; while( n-- ) *p++ = 0;
}
static int st_md5_restore_hw_context(mbedtls_md5_context *ctx)
{
uint32_t i;
uint32_t tickstart;
/* allow multi-instance of HASH use: save context for HASH HW module CR */
/* Check that there is no HASH activity on going */
tickstart = HAL_GetTick();
while ((HASH->SR & (HASH_FLAG_BUSY | HASH_FLAG_DMAS)) != 0) {
if ((HAL_GetTick() - tickstart) > ST_MD5_TIMEOUT) {
return 0; // timeout: HASH processor is busy
}
}
HASH->STR = ctx->ctx_save_str;
HASH->CR = (ctx->ctx_save_cr | HASH_CR_INIT);
for (i=0;i<38;i++) {
HASH->CSR[i] = ctx->ctx_save_csr[i];
}
return 1;
}
static int st_md5_save_hw_context(mbedtls_md5_context *ctx)
{
uint32_t i;
uint32_t tickstart;
/* Check that there is no HASH activity on going */
tickstart = HAL_GetTick();
while ((HASH->SR & (HASH_FLAG_BUSY | HASH_FLAG_DMAS)) != 0) {
if ((HAL_GetTick() - tickstart) > ST_MD5_TIMEOUT) {
return 0; // timeout: HASH processor is busy
}
}
/* allow multi-instance of HASH use: restore context for HASH HW module CR */
ctx->ctx_save_cr = HASH->CR;
ctx->ctx_save_str = HASH->STR;
for (i=0;i<38;i++) {
ctx->ctx_save_csr[i] = HASH->CSR[i];
}
return 1;
}
void mbedtls_md5_init( mbedtls_md5_context *ctx )
{
mbedtls_zeroize( ctx, sizeof( mbedtls_md5_context ) );
/* Enable HASH clock */
__HAL_RCC_HASH_CLK_ENABLE();
}
void mbedtls_md5_free( mbedtls_md5_context *ctx )
{
if( ctx == NULL )
return;
mbedtls_zeroize( ctx, sizeof( mbedtls_md5_context ) );
}
void mbedtls_md5_clone( mbedtls_md5_context *dst,
const mbedtls_md5_context *src )
{
*dst = *src;
}
void mbedtls_md5_starts( mbedtls_md5_context *ctx )
{
/* HASH IP initialization */
if (HAL_HASH_DeInit(&ctx->hhash_md5) != 0) {
// error found to be returned
return;
}
/* HASH Configuration */
ctx->hhash_md5.Init.DataType = HASH_DATATYPE_8B;
/* clear CR ALGO value */
HASH->CR &= ~HASH_CR_ALGO_Msk;
if (HAL_HASH_Init(&ctx->hhash_md5) != 0) {
// return error code
return;
}
if (st_md5_save_hw_context(ctx) != 1) {
return; // return HASH_BUSY timeout Error here
}
}
void mbedtls_md5_process( mbedtls_md5_context *ctx, const unsigned char data[ST_MD5_BLOCK_SIZE] )
{
if (st_md5_restore_hw_context(ctx) != 1) {
return; // Return HASH_BUSY timout error here
}
if (HAL_HASH_MD5_Accumulate(&ctx->hhash_md5, (uint8_t *)data, ST_MD5_BLOCK_SIZE) != 0) {
return; // Return error code here
}
if (st_md5_save_hw_context(ctx) != 1) {
return; // return HASH_BUSY timeout Error here
}
}
void mbedtls_md5_update( mbedtls_md5_context *ctx, const unsigned char *input, size_t ilen )
{
size_t currentlen = ilen;
if (st_md5_restore_hw_context(ctx) != 1) {
return; // Return HASH_BUSY timout error here
}
// store mechanism to accumulate ST_MD5_BLOCK_SIZE bytes (512 bits) in the HW
if (currentlen == 0){ // only change HW status is size if 0
if(ctx->hhash_md5.Phase == HAL_HASH_PHASE_READY) {
/* Select the MD5 mode and reset the HASH processor core, so that the HASH will be ready to compute
the message digest of a new message */
HASH->CR |= HASH_ALGOSELECTION_MD5 | HASH_CR_INIT;
}
ctx->hhash_md5.Phase = HAL_HASH_PHASE_PROCESS;
} else if (currentlen < (ST_MD5_BLOCK_SIZE - ctx->sbuf_len)) {
// only buffurize
memcpy(ctx->sbuf+ctx->sbuf_len, input, currentlen);
ctx->sbuf_len += currentlen;
} else {
// fill buffer and process it
memcpy(ctx->sbuf + ctx->sbuf_len, input, (ST_MD5_BLOCK_SIZE - ctx->sbuf_len));
currentlen -= (ST_MD5_BLOCK_SIZE - ctx->sbuf_len);
mbedtls_md5_process(ctx, ctx->sbuf);
// Process every input as long as it is %64 bytes, ie 512 bits
size_t iter = currentlen / ST_MD5_BLOCK_SIZE;
if (iter !=0) {
if (HAL_HASH_MD5_Accumulate(&ctx->hhash_md5, (uint8_t *)(input + ST_MD5_BLOCK_SIZE - ctx->sbuf_len), (iter * ST_MD5_BLOCK_SIZE)) != 0) {
return; // Return error code here
}
}
// sbuf is completely accumulated, now copy up to 63 remaining bytes
ctx->sbuf_len = currentlen % ST_MD5_BLOCK_SIZE;
if (ctx->sbuf_len !=0) {
memcpy(ctx->sbuf, input + ilen - ctx->sbuf_len, ctx->sbuf_len);
}
}
if (st_md5_save_hw_context(ctx) != 1) {
return; // return HASH_BUSY timeout Error here
}
}
void mbedtls_md5_finish( mbedtls_md5_context *ctx, unsigned char output[16] )
{
if (st_md5_restore_hw_context(ctx) != 1) {
return; // Return HASH_BUSY timout error here
}
if (ctx->sbuf_len > 0) {
if (HAL_HASH_MD5_Accumulate(&ctx->hhash_md5, ctx->sbuf, ctx->sbuf_len) != 0) {
return; // Return error code here
}
}
mbedtls_zeroize( ctx->sbuf, ST_MD5_BLOCK_SIZE);
ctx->sbuf_len = 0;
__HAL_HASH_START_DIGEST();
if (HAL_HASH_MD5_Finish(&ctx->hhash_md5, output, 10)) {
// error code to be returned
}
if (st_md5_save_hw_context(ctx) != 1) {
return; // return HASH_BUSY timeout Error here
}
}
#endif /* MBEDTLS_MD5_ALT */
#endif /* MBEDTLS_MD5_C */
|
the_stack_data/759495.c | /******************************************************************************
* $Id: test_load_virtual_ogr.c a5e7f143716411041a782228fde5f9935c11d428 2016-03-13 05:42:13Z Kurt Schwehr $
*
* Project: OpenGIS Simple Features Reference Implementation
* Purpose: Test dynamic loading of SQLite Virtual Table module using OGR layers
* Author: Even Rouault, even dot rouault at mines dash paris dot org
*
******************************************************************************
* Copyright (c) 2012, Even Rouault <even dot rouault at mines-paris dot org>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
****************************************************************************/
#ifdef HAVE_SPATIALITE
#ifdef SPATIALITE_AMALGAMATION
/*
/ using an AMALGAMATED version of SpatiaLite
/ a private internal copy of SQLite is included:
/ so we are required including the SpatiaLite's
/ own header
/
/ IMPORTANT NOTICE: using AMALAGATION is only
/ useful on Windows (to skip DLL hell related oddities)
*/
#include <spatialite/sqlite3.h>
#else
/*
/ You MUST NOT use AMALGAMATION on Linux or any
/ other "sane" operating system !!!!
*/
#include "sqlite3.h"
#endif
#else
#include "sqlite3.h"
#endif
#include <stdio.h>
#include <stdlib.h>
#undef NDEBUG
#include <assert.h>
#ifndef _MSC_VER
#include <unistd.h>
#endif
#if _MSC_VER
#define snprintf _snprintf
#endif
int main(int argc, char* argv[])
{
sqlite3* db = NULL;
char* pszErrMsg = NULL;
char** papszResult = NULL;
int nRowCount = 0, nColCount = 0;
int rc;
char szBuffer[256];
if( argc < 2 || argc > 4 )
{
fprintf(stderr, "Usage: test_load_virtual_ogr libgdal.so|gdalXX.dll [datasource_name] [layer_name]\n");
exit(1);
}
sqlite3_open("tmp.db", &db);
if( db == NULL )
{
fprintf(stderr, "cannot open DB.\n");
exit(1);
}
rc = sqlite3_enable_load_extension(db, 1);
if( rc != SQLITE_OK )
{
fprintf(stderr, "sqlite3_enable_load_extension() failed\n");
sqlite3_close(db);
unlink("tmp.db");
exit(1);
}
rc = sqlite3_load_extension(db, argv[1], NULL, &pszErrMsg);
if( rc != SQLITE_OK )
{
fprintf(stderr, "sqlite3_load_extension(%s) failed: %s\n", argv[1], pszErrMsg);
sqlite3_free( pszErrMsg );
sqlite3_close(db);
unlink("tmp.db");
exit(1);
}
rc = sqlite3_get_table( db, "SELECT ogr_version()",
&papszResult, &nRowCount, &nColCount,
&pszErrMsg );
if( rc == SQLITE_OK && nRowCount == 1 && nColCount == 1 )
{
printf("SELECT ogr_version() returned : %s\n", papszResult[1]);
}
else
{
fprintf(stderr, "SELECT ogr_version() failed: %s\n", pszErrMsg);
sqlite3_free( pszErrMsg );
sqlite3_close(db);
unlink("tmp.db");
exit(1);
}
sqlite3_free_table(papszResult);
if( argc >= 3 )
{
if( argc == 3 )
{
snprintf(szBuffer, sizeof(szBuffer),
"CREATE VIRTUAL TABLE foo USING VirtualOGR('%s')",
argv[2]);
}
else
{
snprintf(szBuffer, sizeof(szBuffer),
"CREATE VIRTUAL TABLE foo USING VirtualOGR('%s', 0, '%s', 1)",
argv[2], argv[3]);
}
rc = sqlite3_exec(db, szBuffer, NULL, NULL, &pszErrMsg);
if( rc != SQLITE_OK )
{
fprintf(stderr, "%s failed: %s\n", szBuffer, pszErrMsg);
sqlite3_free( pszErrMsg );
sqlite3_close(db);
unlink("tmp.db");
exit(1);
}
else
{
if( argc == 3 )
printf("Managed to open '%s'\n", argv[2]);
else
printf("Managed to open '%s':'%s'\n", argv[2], argv[3]);
assert(SQLITE_OK == sqlite3_exec(db, "CREATE TABLE spy_table (spy_content VARCHAR)", NULL, NULL, NULL));
assert(SQLITE_OK == sqlite3_exec(db, "CREATE TABLE regular_table (bar VARCHAR)", NULL, NULL, NULL));
assert(SQLITE_OK == sqlite3_exec(db, "CREATE TRIGGER spy_trigger INSERT ON regular_table BEGIN "
"INSERT OR REPLACE INTO spy_table (spy_content) "
"SELECT OGR_STYLE FROM foo; END;", NULL, NULL, NULL));
sqlite3_close(db);
db = NULL;
sqlite3_open("tmp.db", &db);
if( db == NULL )
{
fprintf(stderr, "cannot reopen DB.\n");
unlink("tmp.db");
exit(1);
}
assert(SQLITE_OK == sqlite3_enable_load_extension(db, 1));
assert(SQLITE_OK == sqlite3_load_extension(db, argv[1], NULL, NULL));
pszErrMsg = NULL;
assert(SQLITE_OK != sqlite3_exec(db, "INSERT INTO regular_table (bar) VALUES ('bar')", NULL, NULL, &pszErrMsg));
fprintf(stderr, "Expected error. We got : %s\n", pszErrMsg);
sqlite3_free(pszErrMsg);
}
}
sqlite3_close(db);
unlink("tmp.db");
return 0;
}
|
the_stack_data/206393594.c | #include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <complex.h>
#ifdef complex
#undef complex
#endif
#ifdef I
#undef I
#endif
#if defined(_WIN64)
typedef long long BLASLONG;
typedef unsigned long long BLASULONG;
#else
typedef long BLASLONG;
typedef unsigned long BLASULONG;
#endif
#ifdef LAPACK_ILP64
typedef BLASLONG blasint;
#if defined(_WIN64)
#define blasabs(x) llabs(x)
#else
#define blasabs(x) labs(x)
#endif
#else
typedef int blasint;
#define blasabs(x) abs(x)
#endif
typedef blasint integer;
typedef unsigned int uinteger;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
#ifdef _MSC_VER
static inline _Fcomplex Cf(complex *z) {_Fcomplex zz={z->r , z->i}; return zz;}
static inline _Dcomplex Cd(doublecomplex *z) {_Dcomplex zz={z->r , z->i};return zz;}
static inline _Fcomplex * _pCf(complex *z) {return (_Fcomplex*)z;}
static inline _Dcomplex * _pCd(doublecomplex *z) {return (_Dcomplex*)z;}
#else
static inline _Complex float Cf(complex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex double Cd(doublecomplex *z) {return z->r + z->i*_Complex_I;}
static inline _Complex float * _pCf(complex *z) {return (_Complex float*)z;}
static inline _Complex double * _pCd(doublecomplex *z) {return (_Complex double*)z;}
#endif
#define pCf(z) (*_pCf(z))
#define pCd(z) (*_pCd(z))
typedef int logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
#define TRUE_ (1)
#define FALSE_ (0)
/* Extern is for use with -E */
#ifndef Extern
#define Extern extern
#endif
/* I/O stuff */
typedef int flag;
typedef int ftnlen;
typedef int ftnint;
/*external read, write*/
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
/*internal read, write*/
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
/*open*/
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
/*close*/
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
/*rewind, backspace, endfile*/
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
/* inquire */
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; /*parameters in standard's order*/
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
#define VOID void
union Multitype { /* for multiple entry points */
integer1 g;
shortint h;
integer i;
/* longint j; */
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
struct Vardesc { /* for Namelist */
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
#define abs(x) ((x) >= 0 ? (x) : -(x))
#define dabs(x) (fabs(x))
#define f2cmin(a,b) ((a) <= (b) ? (a) : (b))
#define f2cmax(a,b) ((a) >= (b) ? (a) : (b))
#define dmin(a,b) (f2cmin(a,b))
#define dmax(a,b) (f2cmax(a,b))
#define bit_test(a,b) ((a) >> (b) & 1)
#define bit_clear(a,b) ((a) & ~((uinteger)1 << (b)))
#define bit_set(a,b) ((a) | ((uinteger)1 << (b)))
#define abort_() { sig_die("Fortran abort routine called", 1); }
#define c_abs(z) (cabsf(Cf(z)))
#define c_cos(R,Z) { pCf(R)=ccos(Cf(Z)); }
#ifdef _MSC_VER
#define c_div(c, a, b) {Cf(c)._Val[0] = (Cf(a)._Val[0]/Cf(b)._Val[0]); Cf(c)._Val[1]=(Cf(a)._Val[1]/Cf(b)._Val[1]);}
#define z_div(c, a, b) {Cd(c)._Val[0] = (Cd(a)._Val[0]/Cd(b)._Val[0]); Cd(c)._Val[1]=(Cd(a)._Val[1]/df(b)._Val[1]);}
#else
#define c_div(c, a, b) {pCf(c) = Cf(a)/Cf(b);}
#define z_div(c, a, b) {pCd(c) = Cd(a)/Cd(b);}
#endif
#define c_exp(R, Z) {pCf(R) = cexpf(Cf(Z));}
#define c_log(R, Z) {pCf(R) = clogf(Cf(Z));}
#define c_sin(R, Z) {pCf(R) = csinf(Cf(Z));}
//#define c_sqrt(R, Z) {*(R) = csqrtf(Cf(Z));}
#define c_sqrt(R, Z) {pCf(R) = csqrtf(Cf(Z));}
#define d_abs(x) (fabs(*(x)))
#define d_acos(x) (acos(*(x)))
#define d_asin(x) (asin(*(x)))
#define d_atan(x) (atan(*(x)))
#define d_atn2(x, y) (atan2(*(x),*(y)))
#define d_cnjg(R, Z) { pCd(R) = conj(Cd(Z)); }
#define r_cnjg(R, Z) { pCf(R) = conjf(Cf(Z)); }
#define d_cos(x) (cos(*(x)))
#define d_cosh(x) (cosh(*(x)))
#define d_dim(__a, __b) ( *(__a) > *(__b) ? *(__a) - *(__b) : 0.0 )
#define d_exp(x) (exp(*(x)))
#define d_imag(z) (cimag(Cd(z)))
#define r_imag(z) (cimagf(Cf(z)))
#define d_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define r_int(__x) (*(__x)>0 ? floor(*(__x)) : -floor(- *(__x)))
#define d_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define r_lg10(x) ( 0.43429448190325182765 * log(*(x)) )
#define d_log(x) (log(*(x)))
#define d_mod(x, y) (fmod(*(x), *(y)))
#define u_nint(__x) ((__x)>=0 ? floor((__x) + .5) : -floor(.5 - (__x)))
#define d_nint(x) u_nint(*(x))
#define u_sign(__a,__b) ((__b) >= 0 ? ((__a) >= 0 ? (__a) : -(__a)) : -((__a) >= 0 ? (__a) : -(__a)))
#define d_sign(a,b) u_sign(*(a),*(b))
#define r_sign(a,b) u_sign(*(a),*(b))
#define d_sin(x) (sin(*(x)))
#define d_sinh(x) (sinh(*(x)))
#define d_sqrt(x) (sqrt(*(x)))
#define d_tan(x) (tan(*(x)))
#define d_tanh(x) (tanh(*(x)))
#define i_abs(x) abs(*(x))
#define i_dnnt(x) ((integer)u_nint(*(x)))
#define i_len(s, n) (n)
#define i_nint(x) ((integer)u_nint(*(x)))
#define i_sign(a,b) ((integer)u_sign((integer)*(a),(integer)*(b)))
#define pow_dd(ap, bp) ( pow(*(ap), *(bp)))
#define pow_si(B,E) spow_ui(*(B),*(E))
#define pow_ri(B,E) spow_ui(*(B),*(E))
#define pow_di(B,E) dpow_ui(*(B),*(E))
#define pow_zi(p, a, b) {pCd(p) = zpow_ui(Cd(a), *(b));}
#define pow_ci(p, a, b) {pCf(p) = cpow_ui(Cf(a), *(b));}
#define pow_zz(R,A,B) {pCd(R) = cpow(Cd(A),*(B));}
#define s_cat(lpp, rpp, rnp, np, llp) { ftnlen i, nc, ll; char *f__rp, *lp; ll = (llp); lp = (lpp); for(i=0; i < (int)*(np); ++i) { nc = ll; if((rnp)[i] < nc) nc = (rnp)[i]; ll -= nc; f__rp = (rpp)[i]; while(--nc >= 0) *lp++ = *(f__rp)++; } while(--ll >= 0) *lp++ = ' '; }
#define s_cmp(a,b,c,d) ((integer)strncmp((a),(b),f2cmin((c),(d))))
#define s_copy(A,B,C,D) { int __i,__m; for (__i=0, __m=f2cmin((C),(D)); __i<__m && (B)[__i] != 0; ++__i) (A)[__i] = (B)[__i]; }
#define sig_die(s, kill) { exit(1); }
#define s_stop(s, n) {exit(0);}
static char junk[] = "\n@(#)LIBF77 VERSION 19990503\n";
#define z_abs(z) (cabs(Cd(z)))
#define z_exp(R, Z) {pCd(R) = cexp(Cd(Z));}
#define z_sqrt(R, Z) {pCd(R) = csqrt(Cd(Z));}
#define myexit_() break;
#define mycycle() continue;
#define myceiling(w) {ceil(w)}
#define myhuge(w) {HUGE_VAL}
//#define mymaxloc_(w,s,e,n) {if (sizeof(*(w)) == sizeof(double)) dmaxloc_((w),*(s),*(e),n); else dmaxloc_((w),*(s),*(e),n);}
#define mymaxloc(w,s,e,n) {dmaxloc_(w,*(s),*(e),n)}
/* procedure parameter types for -A and -C++ */
#define F2C_proc_par_types 1
#ifdef __cplusplus
typedef logical (*L_fp)(...);
#else
typedef logical (*L_fp)();
#endif
static float spow_ui(float x, integer n) {
float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static double dpow_ui(double x, integer n) {
double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#ifdef _MSC_VER
static _Fcomplex cpow_ui(complex x, integer n) {
complex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x.r = 1/x.r, x.i=1/x.i;
for(u = n; ; ) {
if(u & 01) pow.r *= x.r, pow.i *= x.i;
if(u >>= 1) x.r *= x.r, x.i *= x.i;
else break;
}
}
_Fcomplex p={pow.r, pow.i};
return p;
}
#else
static _Complex float cpow_ui(_Complex float x, integer n) {
_Complex float pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
#ifdef _MSC_VER
static _Dcomplex zpow_ui(_Dcomplex x, integer n) {
_Dcomplex pow={1.0,0.0}; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x._Val[0] = 1/x._Val[0], x._Val[1] =1/x._Val[1];
for(u = n; ; ) {
if(u & 01) pow._Val[0] *= x._Val[0], pow._Val[1] *= x._Val[1];
if(u >>= 1) x._Val[0] *= x._Val[0], x._Val[1] *= x._Val[1];
else break;
}
}
_Dcomplex p = {pow._Val[0], pow._Val[1]};
return p;
}
#else
static _Complex double zpow_ui(_Complex double x, integer n) {
_Complex double pow=1.0; unsigned long int u;
if(n != 0) {
if(n < 0) n = -n, x = 1/x;
for(u = n; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
#endif
static integer pow_ii(integer x, integer n) {
integer pow; unsigned long int u;
if (n <= 0) {
if (n == 0 || x == 1) pow = 1;
else if (x != -1) pow = x == 0 ? 1/x : 0;
else n = -n;
}
if ((n > 0) || !(n == 0 || x == 1 || x != -1)) {
u = n;
for(pow = 1; ; ) {
if(u & 01) pow *= x;
if(u >>= 1) x *= x;
else break;
}
}
return pow;
}
static integer dmaxloc_(double *w, integer s, integer e, integer *n)
{
double m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static integer smaxloc_(float *w, integer s, integer e, integer *n)
{
float m; integer i, mi;
for(m=w[s-1], mi=s, i=s+1; i<=e; i++)
if (w[i-1]>m) mi=i ,m=w[i-1];
return mi-s+1;
}
static inline void cdotc_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i]))._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i]))._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conjf(Cf(&x[i*incx]))._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += conjf(Cf(&x[i*incx]))._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i])) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conjf(Cf(&x[i*incx])) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotc_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i]))._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i]))._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += conj(Cd(&x[i*incx]))._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += conj(Cd(&x[i*incx]))._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i])) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += conj(Cd(&x[i*incx])) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
static inline void cdotu_(complex *z, integer *n_, complex *x, integer *incx_, complex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Fcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i])._Val[0] * Cf(&y[i])._Val[0];
zdotc._Val[1] += Cf(&x[i])._Val[1] * Cf(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cf(&x[i*incx])._Val[0] * Cf(&y[i*incy])._Val[0];
zdotc._Val[1] += Cf(&x[i*incx])._Val[1] * Cf(&y[i*incy])._Val[1];
}
}
pCf(z) = zdotc;
}
#else
_Complex float zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i]) * Cf(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cf(&x[i*incx]) * Cf(&y[i*incy]);
}
}
pCf(z) = zdotc;
}
#endif
static inline void zdotu_(doublecomplex *z, integer *n_, doublecomplex *x, integer *incx_, doublecomplex *y, integer *incy_) {
integer n = *n_, incx = *incx_, incy = *incy_, i;
#ifdef _MSC_VER
_Dcomplex zdotc = {0.0, 0.0};
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i])._Val[0] * Cd(&y[i])._Val[0];
zdotc._Val[1] += Cd(&x[i])._Val[1] * Cd(&y[i])._Val[1];
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc._Val[0] += Cd(&x[i*incx])._Val[0] * Cd(&y[i*incy])._Val[0];
zdotc._Val[1] += Cd(&x[i*incx])._Val[1] * Cd(&y[i*incy])._Val[1];
}
}
pCd(z) = zdotc;
}
#else
_Complex double zdotc = 0.0;
if (incx == 1 && incy == 1) {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i]) * Cd(&y[i]);
}
} else {
for (i=0;i<n;i++) { /* zdotc = zdotc + dconjg(x(i))* y(i) */
zdotc += Cd(&x[i*incx]) * Cd(&y[i*incy]);
}
}
pCd(z) = zdotc;
}
#endif
/* -- translated by f2c (version 20000121).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
*/
/* > \brief <b> SGTSV computes the solution to system of linear equations A * X = B for GT matrices </b> */
/* =========== DOCUMENTATION =========== */
/* Online html documentation available at */
/* http://www.netlib.org/lapack/explore-html/ */
/* > \htmlonly */
/* > Download SGTSV + dependencies */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/sgtsv.f
"> */
/* > [TGZ]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/sgtsv.f
"> */
/* > [ZIP]</a> */
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/sgtsv.f
"> */
/* > [TXT]</a> */
/* > \endhtmlonly */
/* Definition: */
/* =========== */
/* SUBROUTINE SGTSV( N, NRHS, DL, D, DU, B, LDB, INFO ) */
/* INTEGER INFO, LDB, N, NRHS */
/* REAL B( LDB, * ), D( * ), DL( * ), DU( * ) */
/* > \par Purpose: */
/* ============= */
/* > */
/* > \verbatim */
/* > */
/* > SGTSV solves the equation */
/* > */
/* > A*X = B, */
/* > */
/* > where A is an n by n tridiagonal matrix, by Gaussian elimination with */
/* > partial pivoting. */
/* > */
/* > Note that the equation A**T*X = B may be solved by interchanging the */
/* > order of the arguments DU and DL. */
/* > \endverbatim */
/* Arguments: */
/* ========== */
/* > \param[in] N */
/* > \verbatim */
/* > N is INTEGER */
/* > The order of the matrix A. N >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in] NRHS */
/* > \verbatim */
/* > NRHS is INTEGER */
/* > The number of right hand sides, i.e., the number of columns */
/* > of the matrix B. NRHS >= 0. */
/* > \endverbatim */
/* > */
/* > \param[in,out] DL */
/* > \verbatim */
/* > DL is REAL array, dimension (N-1) */
/* > On entry, DL must contain the (n-1) sub-diagonal elements of */
/* > A. */
/* > */
/* > On exit, DL is overwritten by the (n-2) elements of the */
/* > second super-diagonal of the upper triangular matrix U from */
/* > the LU factorization of A, in DL(1), ..., DL(n-2). */
/* > \endverbatim */
/* > */
/* > \param[in,out] D */
/* > \verbatim */
/* > D is REAL array, dimension (N) */
/* > On entry, D must contain the diagonal elements of A. */
/* > */
/* > On exit, D is overwritten by the n diagonal elements of U. */
/* > \endverbatim */
/* > */
/* > \param[in,out] DU */
/* > \verbatim */
/* > DU is REAL array, dimension (N-1) */
/* > On entry, DU must contain the (n-1) super-diagonal elements */
/* > of A. */
/* > */
/* > On exit, DU is overwritten by the (n-1) elements of the first */
/* > super-diagonal of U. */
/* > \endverbatim */
/* > */
/* > \param[in,out] B */
/* > \verbatim */
/* > B is REAL array, dimension (LDB,NRHS) */
/* > On entry, the N by NRHS matrix of right hand side matrix B. */
/* > On exit, if INFO = 0, the N by NRHS solution matrix X. */
/* > \endverbatim */
/* > */
/* > \param[in] LDB */
/* > \verbatim */
/* > LDB is INTEGER */
/* > The leading dimension of the array B. LDB >= f2cmax(1,N). */
/* > \endverbatim */
/* > */
/* > \param[out] INFO */
/* > \verbatim */
/* > INFO is INTEGER */
/* > = 0: successful exit */
/* > < 0: if INFO = -i, the i-th argument had an illegal value */
/* > > 0: if INFO = i, U(i,i) is exactly zero, and the solution */
/* > has not been computed. The factorization has not been */
/* > completed unless i = N. */
/* > \endverbatim */
/* Authors: */
/* ======== */
/* > \author Univ. of Tennessee */
/* > \author Univ. of California Berkeley */
/* > \author Univ. of Colorado Denver */
/* > \author NAG Ltd. */
/* > \date December 2016 */
/* > \ingroup realGTsolve */
/* ===================================================================== */
/* Subroutine */ int sgtsv_(integer *n, integer *nrhs, real *dl, real *d__,
real *du, real *b, integer *ldb, integer *info)
{
/* System generated locals */
integer b_dim1, b_offset, i__1, i__2;
real r__1, r__2;
/* Local variables */
real fact, temp;
integer i__, j;
extern /* Subroutine */ int xerbla_(char *, integer *, ftnlen);
/* -- LAPACK driver routine (version 3.7.0) -- */
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
/* December 2016 */
/* ===================================================================== */
/* Parameter adjustments */
--dl;
--d__;
--du;
b_dim1 = *ldb;
b_offset = 1 + b_dim1 * 1;
b -= b_offset;
/* Function Body */
*info = 0;
if (*n < 0) {
*info = -1;
} else if (*nrhs < 0) {
*info = -2;
} else if (*ldb < f2cmax(1,*n)) {
*info = -7;
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("SGTSV ", &i__1, (ftnlen)5);
return 0;
}
if (*n == 0) {
return 0;
}
if (*nrhs == 1) {
i__1 = *n - 2;
for (i__ = 1; i__ <= i__1; ++i__) {
if ((r__1 = d__[i__], abs(r__1)) >= (r__2 = dl[i__], abs(r__2))) {
/* No row interchange required */
if (d__[i__] != 0.f) {
fact = dl[i__] / d__[i__];
d__[i__ + 1] -= fact * du[i__];
b[i__ + 1 + b_dim1] -= fact * b[i__ + b_dim1];
} else {
*info = i__;
return 0;
}
dl[i__] = 0.f;
} else {
/* Interchange rows I and I+1 */
fact = d__[i__] / dl[i__];
d__[i__] = dl[i__];
temp = d__[i__ + 1];
d__[i__ + 1] = du[i__] - fact * temp;
dl[i__] = du[i__ + 1];
du[i__ + 1] = -fact * dl[i__];
du[i__] = temp;
temp = b[i__ + b_dim1];
b[i__ + b_dim1] = b[i__ + 1 + b_dim1];
b[i__ + 1 + b_dim1] = temp - fact * b[i__ + 1 + b_dim1];
}
/* L10: */
}
if (*n > 1) {
i__ = *n - 1;
if ((r__1 = d__[i__], abs(r__1)) >= (r__2 = dl[i__], abs(r__2))) {
if (d__[i__] != 0.f) {
fact = dl[i__] / d__[i__];
d__[i__ + 1] -= fact * du[i__];
b[i__ + 1 + b_dim1] -= fact * b[i__ + b_dim1];
} else {
*info = i__;
return 0;
}
} else {
fact = d__[i__] / dl[i__];
d__[i__] = dl[i__];
temp = d__[i__ + 1];
d__[i__ + 1] = du[i__] - fact * temp;
du[i__] = temp;
temp = b[i__ + b_dim1];
b[i__ + b_dim1] = b[i__ + 1 + b_dim1];
b[i__ + 1 + b_dim1] = temp - fact * b[i__ + 1 + b_dim1];
}
}
if (d__[*n] == 0.f) {
*info = *n;
return 0;
}
} else {
i__1 = *n - 2;
for (i__ = 1; i__ <= i__1; ++i__) {
if ((r__1 = d__[i__], abs(r__1)) >= (r__2 = dl[i__], abs(r__2))) {
/* No row interchange required */
if (d__[i__] != 0.f) {
fact = dl[i__] / d__[i__];
d__[i__ + 1] -= fact * du[i__];
i__2 = *nrhs;
for (j = 1; j <= i__2; ++j) {
b[i__ + 1 + j * b_dim1] -= fact * b[i__ + j * b_dim1];
/* L20: */
}
} else {
*info = i__;
return 0;
}
dl[i__] = 0.f;
} else {
/* Interchange rows I and I+1 */
fact = d__[i__] / dl[i__];
d__[i__] = dl[i__];
temp = d__[i__ + 1];
d__[i__ + 1] = du[i__] - fact * temp;
dl[i__] = du[i__ + 1];
du[i__ + 1] = -fact * dl[i__];
du[i__] = temp;
i__2 = *nrhs;
for (j = 1; j <= i__2; ++j) {
temp = b[i__ + j * b_dim1];
b[i__ + j * b_dim1] = b[i__ + 1 + j * b_dim1];
b[i__ + 1 + j * b_dim1] = temp - fact * b[i__ + 1 + j *
b_dim1];
/* L30: */
}
}
/* L40: */
}
if (*n > 1) {
i__ = *n - 1;
if ((r__1 = d__[i__], abs(r__1)) >= (r__2 = dl[i__], abs(r__2))) {
if (d__[i__] != 0.f) {
fact = dl[i__] / d__[i__];
d__[i__ + 1] -= fact * du[i__];
i__1 = *nrhs;
for (j = 1; j <= i__1; ++j) {
b[i__ + 1 + j * b_dim1] -= fact * b[i__ + j * b_dim1];
/* L50: */
}
} else {
*info = i__;
return 0;
}
} else {
fact = d__[i__] / dl[i__];
d__[i__] = dl[i__];
temp = d__[i__ + 1];
d__[i__ + 1] = du[i__] - fact * temp;
du[i__] = temp;
i__1 = *nrhs;
for (j = 1; j <= i__1; ++j) {
temp = b[i__ + j * b_dim1];
b[i__ + j * b_dim1] = b[i__ + 1 + j * b_dim1];
b[i__ + 1 + j * b_dim1] = temp - fact * b[i__ + 1 + j *
b_dim1];
/* L60: */
}
}
}
if (d__[*n] == 0.f) {
*info = *n;
return 0;
}
}
/* Back solve with the matrix U from the factorization. */
if (*nrhs <= 2) {
j = 1;
L70:
b[*n + j * b_dim1] /= d__[*n];
if (*n > 1) {
b[*n - 1 + j * b_dim1] = (b[*n - 1 + j * b_dim1] - du[*n - 1] * b[
*n + j * b_dim1]) / d__[*n - 1];
}
for (i__ = *n - 2; i__ >= 1; --i__) {
b[i__ + j * b_dim1] = (b[i__ + j * b_dim1] - du[i__] * b[i__ + 1
+ j * b_dim1] - dl[i__] * b[i__ + 2 + j * b_dim1]) / d__[
i__];
/* L80: */
}
if (j < *nrhs) {
++j;
goto L70;
}
} else {
i__1 = *nrhs;
for (j = 1; j <= i__1; ++j) {
b[*n + j * b_dim1] /= d__[*n];
if (*n > 1) {
b[*n - 1 + j * b_dim1] = (b[*n - 1 + j * b_dim1] - du[*n - 1]
* b[*n + j * b_dim1]) / d__[*n - 1];
}
for (i__ = *n - 2; i__ >= 1; --i__) {
b[i__ + j * b_dim1] = (b[i__ + j * b_dim1] - du[i__] * b[i__
+ 1 + j * b_dim1] - dl[i__] * b[i__ + 2 + j * b_dim1])
/ d__[i__];
/* L90: */
}
/* L100: */
}
}
return 0;
/* End of SGTSV */
} /* sgtsv_ */
|
the_stack_data/20449066.c | void fleg(float x, float pl[], int nl)
{
int j;
float twox,f2,f1,d;
pl[1]=1.0;
pl[2]=x;
if (nl > 2) {
twox=2.0*x;
f2=x;
d=1.0;
for (j=3;j<=nl;j++) {
f1=d++;
f2 += twox;
pl[j]=(f2*pl[j-1]-f1*pl[j-2])/d;
}
}
}
|
the_stack_data/71294.c | #include<stdio.h>
int main()
{
int n,i,sum=0;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
sum+=a[i];
printf("%d",sum);
return 0;
}
|
the_stack_data/165766582.c | #include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
char *s;
s = malloc(1024 * sizeof(char));
scanf("%[^\n]", s);
s = realloc(s, strlen(s) + 1);
//Write your logic to print the tokens of the sentence here.
for (char *c = s; *c != NULL; c++) {
if (*c == ' ') {
*c = '\n';
}
}
printf("%s", s);
return 0;
} |
the_stack_data/423447.c | #include <stdio.h>
#include <stdlib.h>
/* Asks the user for input and puts the user reply in the given buffer
prompt: string prompt to display
card_name: buffer where result is stored
*/
void get_card_name(char *prompt, char *card_name) {
puts(prompt);
scanf("%2s", card_name);
}
/* Check whether an integer value is a valid card value
val: int value to check
return: 0 if false, 1 otherwise
*/
int not_valid(int val) {
return val < 1 || val > 10;
}
/* Evaluate whether a value is low or high or neither.
If the value is low, return 1;
else if the value is high, return -1;
else return 0
val: int value to evaluate
return: 0, 1 or -1
*/
int evaluate_value(int val) {
if (val > 2 && val < 7) {
return 1;
} else if (val == 10) {
return -1;
} else {
return 0;
}
}
int main() {
char card_name[3];
int count = 0;
int val;
do {
get_card_name("Enter the card_name: ", card_name);
switch (card_name[0]) {
case 'K':
case 'Q':
case 'J':
val = 10;
break;
case 'A':
val = 1;
break;
case 'X':
continue;
default:
val = atoi(card_name);
if (not_valid(val)) {
puts("I don't understand that value!");
continue;
}
}
count += evaluate_value(val);
printf("Current count: %i\n", count);
} while (card_name[0] != 'X');
return 0;
}
|
the_stack_data/85261.c | #include<stdio.h>
main()
{
switch (printf("Hii"))
{
case 1:
printf("hyderabad");
break;
case 2:
printf("banglore");
break;
case 3:
printf("chennai");
break;
default:
printf("ranchi");
break;
}
}
//OPTIONS
//COMPILER ERROR
//hyderabad
//banglore
//chennai
//ranchi
//Hiichennai
//CORRECT OPTION- Hiichennai
//This is because printf() returns the no of characters of a string passed to it
//In this case 3 will be returned by printf("Hii");
//also using printf() in switch is completely valid
|
the_stack_data/107954218.c | /*
* shmatch.c -- shell interface to posix regular expression matching.
*/
/* Copyright (C) 2003 Free Software Foundation, Inc.
This file is part of GNU Bash, the Bourne Again SHell.
Bash is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Bash is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Bash. If not, see <http://www.gnu.org/licenses/>.
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#if defined (HAVE_POSIX_REGEXP)
#ifdef HAVE_UNISTD_H
# include <unistd.h>
#endif
#include "bashansi.h"
#include <stdio.h>
#include <regex.h>
#include "shell.h"
#include "variables.h"
#include "externs.h"
extern int glob_ignore_case, match_ignore_case;
int
sh_regmatch (string, pattern, flags)
const char *string;
const char *pattern;
int flags;
{
regex_t regex = { 0 };
regmatch_t *matches;
int rflags;
#if defined (ARRAY_VARS)
SHELL_VAR *rematch;
ARRAY *amatch;
int subexp_ind;
char *subexp_str;
int subexp_len;
#endif
int result;
#if defined (ARRAY_VARS)
rematch = (SHELL_VAR *)NULL;
#endif
rflags = REG_EXTENDED;
if (glob_ignore_case || match_ignore_case)
rflags |= REG_ICASE;
#if !defined (ARRAY_VARS)
rflags |= REG_NOSUB;
#endif
if (regcomp (®ex, pattern, rflags))
return 2; /* flag for printing a warning here. */
#if defined (ARRAY_VARS)
matches = (regmatch_t *)malloc (sizeof (regmatch_t) * (regex.re_nsub + 1));
#else
matches = NULL;
#endif
if (regexec (®ex, string, regex.re_nsub + 1, matches, 0))
result = EXECUTION_FAILURE;
else
result = EXECUTION_SUCCESS; /* match */
#if defined (ARRAY_VARS)
subexp_len = strlen (string) + 10;
subexp_str = malloc (subexp_len + 1);
/* Store the parenthesized subexpressions in the array BASH_REMATCH.
Element 0 is the portion that matched the entire regexp. Element 1
is the part that matched the first subexpression, and so on. */
unbind_variable ("BASH_REMATCH");
rematch = make_new_array_variable ("BASH_REMATCH");
amatch = array_cell (rematch);
if ((flags & SHMAT_SUBEXP) && result == EXECUTION_SUCCESS && subexp_str)
{
for (subexp_ind = 0; subexp_ind <= regex.re_nsub; subexp_ind++)
{
memset (subexp_str, 0, subexp_len);
strncpy (subexp_str, string + matches[subexp_ind].rm_so,
matches[subexp_ind].rm_eo - matches[subexp_ind].rm_so);
array_insert (amatch, subexp_ind, subexp_str);
}
}
VSETATTR (rematch, att_readonly);
free (subexp_str);
free (matches);
#endif /* ARRAY_VARS */
regfree (®ex);
return result;
}
#endif /* HAVE_POSIX_REGEXP */
|
the_stack_data/90764904.c | /*
* Substitues __movmem_i4_even from libgcc
*/
void __movmem_i4_even(void *src, void *dst, unsigned long len)
{
unsigned char *sc = src, *dc = dst;
for (unsigned long i = 0; i < len; i++) {
dc[i] = sc[i];
}
}
|
the_stack_data/382886.c | // Ogg Vorbis audio decoder - v1.21 - public domain
// http://nothings.org/stb_vorbis/
//
// Original version written by Sean Barrett in 2007.
//
// Originally sponsored by RAD Game Tools. Seeking implementation
// sponsored by Phillip Bennefall, Marc Andersen, Aaron Baker,
// Elias Software, Aras Pranckevicius, and Sean Barrett.
//
// LICENSE
//
// See end of file for license information.
//
// Limitations:
//
// - floor 0 not supported (used in old ogg vorbis files pre-2004)
// - lossless sample-truncation at beginning ignored
// - cannot concatenate multiple vorbis streams
// - sample positions are 32-bit, limiting seekable 192Khz
// files to around 6 hours (Ogg supports 64-bit)
//
// Feature contributors:
// Dougall Johnson (sample-exact seeking)
//
// Bugfix/warning contributors:
// Terje Mathisen Niklas Frykholm Andy Hill
// Casey Muratori John Bolton Gargaj
// Laurent Gomila Marc LeBlanc Ronny Chevalier
// Bernhard Wodo Evan Balster github:alxprd
// Tom Beaumont Ingo Leitgeb Nicolas Guillemot
// Phillip Bennefall Rohit Thiago Goulart
// github:manxorist saga musix github:infatum
// Timur Gagiev Maxwell Koo Peter Waller
// github:audinowho Dougall Johnson David Reid
// github:Clownacy Pedro J. Estebanez Remi Verschelde
// AnthoFoxo
//
// Partial history:
// 1.21 - 2021-07-02 - fix bug for files with no comments
// 1.20 - 2020-07-11 - several small fixes
// 1.19 - 2020-02-05 - warnings
// 1.18 - 2020-02-02 - fix seek bugs; parse header comments; misc warnings etc.
// 1.17 - 2019-07-08 - fix CVE-2019-13217..CVE-2019-13223 (by ForAllSecure)
// 1.16 - 2019-03-04 - fix warnings
// 1.15 - 2019-02-07 - explicit failure if Ogg Skeleton data is found
// 1.14 - 2018-02-11 - delete bogus dealloca usage
// 1.13 - 2018-01-29 - fix truncation of last frame (hopefully)
// 1.12 - 2017-11-21 - limit residue begin/end to blocksize/2 to avoid large temp allocs in bad/corrupt files
// 1.11 - 2017-07-23 - fix MinGW compilation
// 1.10 - 2017-03-03 - more robust seeking; fix negative ilog(); clear error in open_memory
// 1.09 - 2016-04-04 - back out 'truncation of last frame' fix from previous version
// 1.08 - 2016-04-02 - warnings; setup memory leaks; truncation of last frame
// 1.07 - 2015-01-16 - fixes for crashes on invalid files; warning fixes; const
// 1.06 - 2015-08-31 - full, correct support for seeking API (Dougall Johnson)
// some crash fixes when out of memory or with corrupt files
// fix some inappropriately signed shifts
// 1.05 - 2015-04-19 - don't define __forceinline if it's redundant
// 1.04 - 2014-08-27 - fix missing const-correct case in API
// 1.03 - 2014-08-07 - warning fixes
// 1.02 - 2014-07-09 - declare qsort comparison as explicitly _cdecl in Windows
// 1.01 - 2014-06-18 - fix stb_vorbis_get_samples_float (interleaved was correct)
// 1.0 - 2014-05-26 - fix memory leaks; fix warnings; fix bugs in >2-channel;
// (API change) report sample rate for decode-full-file funcs
//
// See end of file for full version history.
//////////////////////////////////////////////////////////////////////////////
//
// HEADER BEGINS HERE
//
#ifndef STB_VORBIS_INCLUDE_STB_VORBIS_H
#define STB_VORBIS_INCLUDE_STB_VORBIS_H
#if defined(STB_VORBIS_NO_CRT) && !defined(STB_VORBIS_NO_STDIO)
#define STB_VORBIS_NO_STDIO 1
#endif
#ifndef STB_VORBIS_NO_STDIO
#include <stdio.h>
#endif
#ifdef __cplusplus
extern "C" {
#endif
/////////// THREAD SAFETY
// Individual stb_vorbis* handles are not thread-safe; you cannot decode from
// them from multiple threads at the same time. However, you can have multiple
// stb_vorbis* handles and decode from them independently in multiple thrads.
/////////// MEMORY ALLOCATION
// normally stb_vorbis uses malloc() to allocate memory at startup,
// and alloca() to allocate temporary memory during a frame on the
// stack. (Memory consumption will depend on the amount of setup
// data in the file and how you set the compile flags for speed
// vs. size. In my test files the maximal-size usage is ~150KB.)
//
// You can modify the wrapper functions in the source (setup_malloc,
// setup_temp_malloc, temp_malloc) to change this behavior, or you
// can use a simpler allocation model: you pass in a buffer from
// which stb_vorbis will allocate _all_ its memory (including the
// temp memory). "open" may fail with a VORBIS_outofmem if you
// do not pass in enough data; there is no way to determine how
// much you do need except to succeed (at which point you can
// query get_info to find the exact amount required. yes I know
// this is lame).
//
// If you pass in a non-NULL buffer of the type below, allocation
// will occur from it as described above. Otherwise just pass NULL
// to use malloc()/alloca()
typedef struct
{
char *alloc_buffer;
int alloc_buffer_length_in_bytes;
} stb_vorbis_alloc;
/////////// FUNCTIONS USEABLE WITH ALL INPUT MODES
typedef struct stb_vorbis stb_vorbis;
typedef struct
{
unsigned int sample_rate;
int channels;
unsigned int setup_memory_required;
unsigned int setup_temp_memory_required;
unsigned int temp_memory_required;
int max_frame_size;
} stb_vorbis_info;
typedef struct
{
char *vendor;
int comment_list_length;
char **comment_list;
} stb_vorbis_comment;
// get general information about the file
extern stb_vorbis_info stb_vorbis_get_info(stb_vorbis *f);
// get ogg comments
extern stb_vorbis_comment stb_vorbis_get_comment(stb_vorbis *f);
// get the last error detected (clears it, too)
extern int stb_vorbis_get_error(stb_vorbis *f);
// close an ogg vorbis file and free all memory in use
extern void stb_vorbis_close(stb_vorbis *f);
// this function returns the offset (in samples) from the beginning of the
// file that will be returned by the next decode, if it is known, or -1
// otherwise. after a flush_pushdata() call, this may take a while before
// it becomes valid again.
// NOT WORKING YET after a seek with PULLDATA API
extern int stb_vorbis_get_sample_offset(stb_vorbis *f);
// returns the current seek point within the file, or offset from the beginning
// of the memory buffer. In pushdata mode it returns 0.
extern unsigned int stb_vorbis_get_file_offset(stb_vorbis *f);
/////////// PUSHDATA API
#ifndef STB_VORBIS_NO_PUSHDATA_API
// this API allows you to get blocks of data from any source and hand
// them to stb_vorbis. you have to buffer them; stb_vorbis will tell
// you how much it used, and you have to give it the rest next time;
// and stb_vorbis may not have enough data to work with and you will
// need to give it the same data again PLUS more. Note that the Vorbis
// specification does not bound the size of an individual frame.
extern stb_vorbis *stb_vorbis_open_pushdata(
const unsigned char * datablock, int datablock_length_in_bytes,
int *datablock_memory_consumed_in_bytes,
int *error,
const stb_vorbis_alloc *alloc_buffer);
// create a vorbis decoder by passing in the initial data block containing
// the ogg&vorbis headers (you don't need to do parse them, just provide
// the first N bytes of the file--you're told if it's not enough, see below)
// on success, returns an stb_vorbis *, does not set error, returns the amount of
// data parsed/consumed on this call in *datablock_memory_consumed_in_bytes;
// on failure, returns NULL on error and sets *error, does not change *datablock_memory_consumed
// if returns NULL and *error is VORBIS_need_more_data, then the input block was
// incomplete and you need to pass in a larger block from the start of the file
extern int stb_vorbis_decode_frame_pushdata(
stb_vorbis *f,
const unsigned char *datablock, int datablock_length_in_bytes,
int *channels, // place to write number of float * buffers
float ***output, // place to write float ** array of float * buffers
int *samples // place to write number of output samples
);
// decode a frame of audio sample data if possible from the passed-in data block
//
// return value: number of bytes we used from datablock
//
// possible cases:
// 0 bytes used, 0 samples output (need more data)
// N bytes used, 0 samples output (resynching the stream, keep going)
// N bytes used, M samples output (one frame of data)
// note that after opening a file, you will ALWAYS get one N-bytes,0-sample
// frame, because Vorbis always "discards" the first frame.
//
// Note that on resynch, stb_vorbis will rarely consume all of the buffer,
// instead only datablock_length_in_bytes-3 or less. This is because it wants
// to avoid missing parts of a page header if they cross a datablock boundary,
// without writing state-machiney code to record a partial detection.
//
// The number of channels returned are stored in *channels (which can be
// NULL--it is always the same as the number of channels reported by
// get_info). *output will contain an array of float* buffers, one per
// channel. In other words, (*output)[0][0] contains the first sample from
// the first channel, and (*output)[1][0] contains the first sample from
// the second channel.
extern void stb_vorbis_flush_pushdata(stb_vorbis *f);
// inform stb_vorbis that your next datablock will not be contiguous with
// previous ones (e.g. you've seeked in the data); future attempts to decode
// frames will cause stb_vorbis to resynchronize (as noted above), and
// once it sees a valid Ogg page (typically 4-8KB, as large as 64KB), it
// will begin decoding the _next_ frame.
//
// if you want to seek using pushdata, you need to seek in your file, then
// call stb_vorbis_flush_pushdata(), then start calling decoding, then once
// decoding is returning you data, call stb_vorbis_get_sample_offset, and
// if you don't like the result, seek your file again and repeat.
#endif
////////// PULLING INPUT API
#ifndef STB_VORBIS_NO_PULLDATA_API
// This API assumes stb_vorbis is allowed to pull data from a source--
// either a block of memory containing the _entire_ vorbis stream, or a
// FILE * that you or it create, or possibly some other reading mechanism
// if you go modify the source to replace the FILE * case with some kind
// of callback to your code. (But if you don't support seeking, you may
// just want to go ahead and use pushdata.)
#if !defined(STB_VORBIS_NO_STDIO) && !defined(STB_VORBIS_NO_INTEGER_CONVERSION)
extern int stb_vorbis_decode_filename(const char *filename, int *channels, int *sample_rate, short **output);
#endif
#if !defined(STB_VORBIS_NO_INTEGER_CONVERSION)
extern int stb_vorbis_decode_memory(const unsigned char *mem, int len, int *channels, int *sample_rate, short **output);
#endif
// decode an entire file and output the data interleaved into a malloc()ed
// buffer stored in *output. The return value is the number of samples
// decoded, or -1 if the file could not be opened or was not an ogg vorbis file.
// When you're done with it, just free() the pointer returned in *output.
extern stb_vorbis * stb_vorbis_open_memory(const unsigned char *data, int len,
int *error, const stb_vorbis_alloc *alloc_buffer);
// create an ogg vorbis decoder from an ogg vorbis stream in memory (note
// this must be the entire stream!). on failure, returns NULL and sets *error
#ifndef STB_VORBIS_NO_STDIO
extern stb_vorbis * stb_vorbis_open_filename(const char *filename,
int *error, const stb_vorbis_alloc *alloc_buffer);
// create an ogg vorbis decoder from a filename via fopen(). on failure,
// returns NULL and sets *error (possibly to VORBIS_file_open_failure).
extern stb_vorbis * stb_vorbis_open_file(FILE *f, int close_handle_on_close,
int *error, const stb_vorbis_alloc *alloc_buffer);
// create an ogg vorbis decoder from an open FILE *, looking for a stream at
// the _current_ seek point (ftell). on failure, returns NULL and sets *error.
// note that stb_vorbis must "own" this stream; if you seek it in between
// calls to stb_vorbis, it will become confused. Moreover, if you attempt to
// perform stb_vorbis_seek_*() operations on this file, it will assume it
// owns the _entire_ rest of the file after the start point. Use the next
// function, stb_vorbis_open_file_section(), to limit it.
extern stb_vorbis * stb_vorbis_open_file_section(FILE *f, int close_handle_on_close,
int *error, const stb_vorbis_alloc *alloc_buffer, unsigned int len);
// create an ogg vorbis decoder from an open FILE *, looking for a stream at
// the _current_ seek point (ftell); the stream will be of length 'len' bytes.
// on failure, returns NULL and sets *error. note that stb_vorbis must "own"
// this stream; if you seek it in between calls to stb_vorbis, it will become
// confused.
#endif
extern int stb_vorbis_seek_frame(stb_vorbis *f, unsigned int sample_number);
extern int stb_vorbis_seek(stb_vorbis *f, unsigned int sample_number);
// these functions seek in the Vorbis file to (approximately) 'sample_number'.
// after calling seek_frame(), the next call to get_frame_*() will include
// the specified sample. after calling stb_vorbis_seek(), the next call to
// stb_vorbis_get_samples_* will start with the specified sample. If you
// do not need to seek to EXACTLY the target sample when using get_samples_*,
// you can also use seek_frame().
extern int stb_vorbis_seek_start(stb_vorbis *f);
// this function is equivalent to stb_vorbis_seek(f,0)
extern unsigned int stb_vorbis_stream_length_in_samples(stb_vorbis *f);
extern float stb_vorbis_stream_length_in_seconds(stb_vorbis *f);
// these functions return the total length of the vorbis stream
extern int stb_vorbis_get_frame_float(stb_vorbis *f, int *channels, float ***output);
// decode the next frame and return the number of samples. the number of
// channels returned are stored in *channels (which can be NULL--it is always
// the same as the number of channels reported by get_info). *output will
// contain an array of float* buffers, one per channel. These outputs will
// be overwritten on the next call to stb_vorbis_get_frame_*.
//
// You generally should not intermix calls to stb_vorbis_get_frame_*()
// and stb_vorbis_get_samples_*(), since the latter calls the former.
#ifndef STB_VORBIS_NO_INTEGER_CONVERSION
extern int stb_vorbis_get_frame_short_interleaved(stb_vorbis *f, int num_c, short *buffer, int num_shorts);
extern int stb_vorbis_get_frame_short (stb_vorbis *f, int num_c, short **buffer, int num_samples);
#endif
// decode the next frame and return the number of *samples* per channel.
// Note that for interleaved data, you pass in the number of shorts (the
// size of your array), but the return value is the number of samples per
// channel, not the total number of samples.
//
// The data is coerced to the number of channels you request according to the
// channel coercion rules (see below). You must pass in the size of your
// buffer(s) so that stb_vorbis will not overwrite the end of the buffer.
// The maximum buffer size needed can be gotten from get_info(); however,
// the Vorbis I specification implies an absolute maximum of 4096 samples
// per channel.
// Channel coercion rules:
// Let M be the number of channels requested, and N the number of channels present,
// and Cn be the nth channel; let stereo L be the sum of all L and center channels,
// and stereo R be the sum of all R and center channels (channel assignment from the
// vorbis spec).
// M N output
// 1 k sum(Ck) for all k
// 2 * stereo L, stereo R
// k l k > l, the first l channels, then 0s
// k l k <= l, the first k channels
// Note that this is not _good_ surround etc. mixing at all! It's just so
// you get something useful.
extern int stb_vorbis_get_samples_float_interleaved(stb_vorbis *f, int channels, float *buffer, int num_floats);
extern int stb_vorbis_get_samples_float(stb_vorbis *f, int channels, float **buffer, int num_samples);
// gets num_samples samples, not necessarily on a frame boundary--this requires
// buffering so you have to supply the buffers. DOES NOT APPLY THE COERCION RULES.
// Returns the number of samples stored per channel; it may be less than requested
// at the end of the file. If there are no more samples in the file, returns 0.
#ifndef STB_VORBIS_NO_INTEGER_CONVERSION
extern int stb_vorbis_get_samples_short_interleaved(stb_vorbis *f, int channels, short *buffer, int num_shorts);
extern int stb_vorbis_get_samples_short(stb_vorbis *f, int channels, short **buffer, int num_samples);
#endif
// gets num_samples samples, not necessarily on a frame boundary--this requires
// buffering so you have to supply the buffers. Applies the coercion rules above
// to produce 'channels' channels. Returns the number of samples stored per channel;
// it may be less than requested at the end of the file. If there are no more
// samples in the file, returns 0.
#endif
//////// ERROR CODES
enum STBVorbisError
{
VORBIS__no_error,
VORBIS_need_more_data=1, // not a real error
VORBIS_invalid_api_mixing, // can't mix API modes
VORBIS_outofmem, // not enough memory
VORBIS_feature_not_supported, // uses floor 0
VORBIS_too_many_channels, // STB_VORBIS_MAX_CHANNELS is too small
VORBIS_file_open_failure, // fopen() failed
VORBIS_seek_without_length, // can't seek in unknown-length file
VORBIS_unexpected_eof=10, // file is truncated?
VORBIS_seek_invalid, // seek past EOF
// decoding errors (corrupt/invalid stream) -- you probably
// don't care about the exact details of these
// vorbis errors:
VORBIS_invalid_setup=20,
VORBIS_invalid_stream,
// ogg errors:
VORBIS_missing_capture_pattern=30,
VORBIS_invalid_stream_structure_version,
VORBIS_continued_packet_flag_invalid,
VORBIS_incorrect_stream_serial_number,
VORBIS_invalid_first_page,
VORBIS_bad_packet_type,
VORBIS_cant_find_last_page,
VORBIS_seek_failed,
VORBIS_ogg_skeleton_not_supported
};
#ifdef __cplusplus
}
#endif
#endif // STB_VORBIS_INCLUDE_STB_VORBIS_H
//
// HEADER ENDS HERE
//
//////////////////////////////////////////////////////////////////////////////
#ifndef STB_VORBIS_HEADER_ONLY
// global configuration settings (e.g. set these in the project/makefile),
// or just set them in this file at the top (although ideally the first few
// should be visible when the header file is compiled too, although it's not
// crucial)
// STB_VORBIS_NO_PUSHDATA_API
// does not compile the code for the various stb_vorbis_*_pushdata()
// functions
// #define STB_VORBIS_NO_PUSHDATA_API
// STB_VORBIS_NO_PULLDATA_API
// does not compile the code for the non-pushdata APIs
// #define STB_VORBIS_NO_PULLDATA_API
// STB_VORBIS_NO_STDIO
// does not compile the code for the APIs that use FILE *s internally
// or externally (implied by STB_VORBIS_NO_PULLDATA_API)
// #define STB_VORBIS_NO_STDIO
// STB_VORBIS_NO_INTEGER_CONVERSION
// does not compile the code for converting audio sample data from
// float to integer (implied by STB_VORBIS_NO_PULLDATA_API)
// #define STB_VORBIS_NO_INTEGER_CONVERSION
// STB_VORBIS_NO_FAST_SCALED_FLOAT
// does not use a fast float-to-int trick to accelerate float-to-int on
// most platforms which requires endianness be defined correctly.
//#define STB_VORBIS_NO_FAST_SCALED_FLOAT
// STB_VORBIS_MAX_CHANNELS [number]
// globally define this to the maximum number of channels you need.
// The spec does not put a restriction on channels except that
// the count is stored in a byte, so 255 is the hard limit.
// Reducing this saves about 16 bytes per value, so using 16 saves
// (255-16)*16 or around 4KB. Plus anything other memory usage
// I forgot to account for. Can probably go as low as 8 (7.1 audio),
// 6 (5.1 audio), or 2 (stereo only).
#ifndef STB_VORBIS_MAX_CHANNELS
#define STB_VORBIS_MAX_CHANNELS 16 // enough for anyone?
#endif
// STB_VORBIS_PUSHDATA_CRC_COUNT [number]
// after a flush_pushdata(), stb_vorbis begins scanning for the
// next valid page, without backtracking. when it finds something
// that looks like a page, it streams through it and verifies its
// CRC32. Should that validation fail, it keeps scanning. But it's
// possible that _while_ streaming through to check the CRC32 of
// one candidate page, it sees another candidate page. This #define
// determines how many "overlapping" candidate pages it can search
// at once. Note that "real" pages are typically ~4KB to ~8KB, whereas
// garbage pages could be as big as 64KB, but probably average ~16KB.
// So don't hose ourselves by scanning an apparent 64KB page and
// missing a ton of real ones in the interim; so minimum of 2
#ifndef STB_VORBIS_PUSHDATA_CRC_COUNT
#define STB_VORBIS_PUSHDATA_CRC_COUNT 4
#endif
// STB_VORBIS_FAST_HUFFMAN_LENGTH [number]
// sets the log size of the huffman-acceleration table. Maximum
// supported value is 24. with larger numbers, more decodings are O(1),
// but the table size is larger so worse cache missing, so you'll have
// to probe (and try multiple ogg vorbis files) to find the sweet spot.
#ifndef STB_VORBIS_FAST_HUFFMAN_LENGTH
#define STB_VORBIS_FAST_HUFFMAN_LENGTH 10
#endif
// STB_VORBIS_FAST_BINARY_LENGTH [number]
// sets the log size of the binary-search acceleration table. this
// is used in similar fashion to the fast-huffman size to set initial
// parameters for the binary search
// STB_VORBIS_FAST_HUFFMAN_INT
// The fast huffman tables are much more efficient if they can be
// stored as 16-bit results instead of 32-bit results. This restricts
// the codebooks to having only 65535 possible outcomes, though.
// (At least, accelerated by the huffman table.)
#ifndef STB_VORBIS_FAST_HUFFMAN_INT
#define STB_VORBIS_FAST_HUFFMAN_SHORT
#endif
// STB_VORBIS_NO_HUFFMAN_BINARY_SEARCH
// If the 'fast huffman' search doesn't succeed, then stb_vorbis falls
// back on binary searching for the correct one. This requires storing
// extra tables with the huffman codes in sorted order. Defining this
// symbol trades off space for speed by forcing a linear search in the
// non-fast case, except for "sparse" codebooks.
// #define STB_VORBIS_NO_HUFFMAN_BINARY_SEARCH
// STB_VORBIS_DIVIDES_IN_RESIDUE
// stb_vorbis precomputes the result of the scalar residue decoding
// that would otherwise require a divide per chunk. you can trade off
// space for time by defining this symbol.
// #define STB_VORBIS_DIVIDES_IN_RESIDUE
// STB_VORBIS_DIVIDES_IN_CODEBOOK
// vorbis VQ codebooks can be encoded two ways: with every case explicitly
// stored, or with all elements being chosen from a small range of values,
// and all values possible in all elements. By default, stb_vorbis expands
// this latter kind out to look like the former kind for ease of decoding,
// because otherwise an integer divide-per-vector-element is required to
// unpack the index. If you define STB_VORBIS_DIVIDES_IN_CODEBOOK, you can
// trade off storage for speed.
//#define STB_VORBIS_DIVIDES_IN_CODEBOOK
#ifdef STB_VORBIS_CODEBOOK_SHORTS
#error "STB_VORBIS_CODEBOOK_SHORTS is no longer supported as it produced incorrect results for some input formats"
#endif
// STB_VORBIS_DIVIDE_TABLE
// this replaces small integer divides in the floor decode loop with
// table lookups. made less than 1% difference, so disabled by default.
// STB_VORBIS_NO_INLINE_DECODE
// disables the inlining of the scalar codebook fast-huffman decode.
// might save a little codespace; useful for debugging
// #define STB_VORBIS_NO_INLINE_DECODE
// STB_VORBIS_NO_DEFER_FLOOR
// Normally we only decode the floor without synthesizing the actual
// full curve. We can instead synthesize the curve immediately. This
// requires more memory and is very likely slower, so I don't think
// you'd ever want to do it except for debugging.
// #define STB_VORBIS_NO_DEFER_FLOOR
//////////////////////////////////////////////////////////////////////////////
#ifdef STB_VORBIS_NO_PULLDATA_API
#define STB_VORBIS_NO_INTEGER_CONVERSION
#define STB_VORBIS_NO_STDIO
#endif
#if defined(STB_VORBIS_NO_CRT) && !defined(STB_VORBIS_NO_STDIO)
#define STB_VORBIS_NO_STDIO 1
#endif
#ifndef STB_VORBIS_NO_INTEGER_CONVERSION
#ifndef STB_VORBIS_NO_FAST_SCALED_FLOAT
// only need endianness for fast-float-to-int, which we don't
// use for pushdata
#ifndef STB_VORBIS_BIG_ENDIAN
#define STB_VORBIS_ENDIAN 0
#else
#define STB_VORBIS_ENDIAN 1
#endif
#endif
#endif
#ifndef STB_VORBIS_NO_STDIO
#include <stdio.h>
#endif
#ifndef STB_VORBIS_NO_CRT
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <math.h>
// find definition of alloca if it's not in stdlib.h:
#if defined(_MSC_VER) || defined(__MINGW32__)
#include <malloc.h>
#endif
#if defined(__linux__) || defined(__linux) || defined(__EMSCRIPTEN__) || defined(__NEWLIB__)
#include <alloca.h>
#endif
#else // STB_VORBIS_NO_CRT
#define NULL 0
#define malloc(s) 0
#define free(s) ((void) 0)
#define realloc(s) 0
#endif // STB_VORBIS_NO_CRT
#include <limits.h>
#ifdef __MINGW32__
// eff you mingw:
// "fixed":
// http://sourceforge.net/p/mingw-w64/mailman/message/32882927/
// "no that broke the build, reverted, who cares about C":
// http://sourceforge.net/p/mingw-w64/mailman/message/32890381/
#ifdef __forceinline
#undef __forceinline
#endif
#define __forceinline
#ifndef alloca
#define alloca __builtin_alloca
#endif
#elif !defined(_MSC_VER)
#if __GNUC__
#define __forceinline inline
#else
#define __forceinline
#endif
#endif
#if STB_VORBIS_MAX_CHANNELS > 256
#error "Value of STB_VORBIS_MAX_CHANNELS outside of allowed range"
#endif
#if STB_VORBIS_FAST_HUFFMAN_LENGTH > 24
#error "Value of STB_VORBIS_FAST_HUFFMAN_LENGTH outside of allowed range"
#endif
#if 0
#include <crtdbg.h>
#define CHECK(f) _CrtIsValidHeapPointer(f->channel_buffers[1])
#else
#define CHECK(f) ((void) 0)
#endif
#define MAX_BLOCKSIZE_LOG 13 // from specification
#define MAX_BLOCKSIZE (1 << MAX_BLOCKSIZE_LOG)
typedef unsigned char uint8;
typedef signed char int8;
typedef unsigned short uint16;
typedef signed short int16;
typedef unsigned int uint32;
typedef signed int int32;
#ifndef TRUE
#define TRUE 1
#define FALSE 0
#endif
typedef float codetype;
// @NOTE
//
// Some arrays below are tagged "//varies", which means it's actually
// a variable-sized piece of data, but rather than malloc I assume it's
// small enough it's better to just allocate it all together with the
// main thing
//
// Most of the variables are specified with the smallest size I could pack
// them into. It might give better performance to make them all full-sized
// integers. It should be safe to freely rearrange the structures or change
// the sizes larger--nothing relies on silently truncating etc., nor the
// order of variables.
#define FAST_HUFFMAN_TABLE_SIZE (1 << STB_VORBIS_FAST_HUFFMAN_LENGTH)
#define FAST_HUFFMAN_TABLE_MASK (FAST_HUFFMAN_TABLE_SIZE - 1)
typedef struct
{
int dimensions, entries;
uint8 *codeword_lengths;
float minimum_value;
float delta_value;
uint8 value_bits;
uint8 lookup_type;
uint8 sequence_p;
uint8 sparse;
uint32 lookup_values;
codetype *multiplicands;
uint32 *codewords;
#ifdef STB_VORBIS_FAST_HUFFMAN_SHORT
int16 fast_huffman[FAST_HUFFMAN_TABLE_SIZE];
#else
int32 fast_huffman[FAST_HUFFMAN_TABLE_SIZE];
#endif
uint32 *sorted_codewords;
int *sorted_values;
int sorted_entries;
} Codebook;
typedef struct
{
uint8 order;
uint16 rate;
uint16 bark_map_size;
uint8 amplitude_bits;
uint8 amplitude_offset;
uint8 number_of_books;
uint8 book_list[16]; // varies
} Floor0;
typedef struct
{
uint8 partitions;
uint8 partition_class_list[32]; // varies
uint8 class_dimensions[16]; // varies
uint8 class_subclasses[16]; // varies
uint8 class_masterbooks[16]; // varies
int16 subclass_books[16][8]; // varies
uint16 Xlist[31*8+2]; // varies
uint8 sorted_order[31*8+2];
uint8 neighbors[31*8+2][2];
uint8 floor1_multiplier;
uint8 rangebits;
int values;
} Floor1;
typedef union
{
Floor0 floor0;
Floor1 floor1;
} Floor;
typedef struct
{
uint32 begin, end;
uint32 part_size;
uint8 classifications;
uint8 classbook;
uint8 **classdata;
int16 (*residue_books)[8];
} Residue;
typedef struct
{
uint8 magnitude;
uint8 angle;
uint8 mux;
} MappingChannel;
typedef struct
{
uint16 coupling_steps;
MappingChannel *chan;
uint8 submaps;
uint8 submap_floor[15]; // varies
uint8 submap_residue[15]; // varies
} Mapping;
typedef struct
{
uint8 blockflag;
uint8 mapping;
uint16 windowtype;
uint16 transformtype;
} Mode;
typedef struct
{
uint32 goal_crc; // expected crc if match
int bytes_left; // bytes left in packet
uint32 crc_so_far; // running crc
int bytes_done; // bytes processed in _current_ chunk
uint32 sample_loc; // granule pos encoded in page
} CRCscan;
typedef struct
{
uint32 page_start, page_end;
uint32 last_decoded_sample;
} ProbedPage;
struct stb_vorbis
{
// user-accessible info
unsigned int sample_rate;
int channels;
unsigned int setup_memory_required;
unsigned int temp_memory_required;
unsigned int setup_temp_memory_required;
char *vendor;
int comment_list_length;
char **comment_list;
// input config
#ifndef STB_VORBIS_NO_STDIO
FILE *f;
uint32 f_start;
int close_on_free;
#endif
uint8 *stream;
uint8 *stream_start;
uint8 *stream_end;
uint32 stream_len;
uint8 push_mode;
// the page to seek to when seeking to start, may be zero
uint32 first_audio_page_offset;
// p_first is the page on which the first audio packet ends
// (but not necessarily the page on which it starts)
ProbedPage p_first, p_last;
// memory management
stb_vorbis_alloc alloc;
int setup_offset;
int temp_offset;
// run-time results
int eof;
enum STBVorbisError error;
// user-useful data
// header info
int blocksize[2];
int blocksize_0, blocksize_1;
int codebook_count;
Codebook *codebooks;
int floor_count;
uint16 floor_types[64]; // varies
Floor *floor_config;
int residue_count;
uint16 residue_types[64]; // varies
Residue *residue_config;
int mapping_count;
Mapping *mapping;
int mode_count;
Mode mode_config[64]; // varies
uint32 total_samples;
// decode buffer
float *channel_buffers[STB_VORBIS_MAX_CHANNELS];
float *outputs [STB_VORBIS_MAX_CHANNELS];
float *previous_window[STB_VORBIS_MAX_CHANNELS];
int previous_length;
#ifndef STB_VORBIS_NO_DEFER_FLOOR
int16 *finalY[STB_VORBIS_MAX_CHANNELS];
#else
float *floor_buffers[STB_VORBIS_MAX_CHANNELS];
#endif
uint32 current_loc; // sample location of next frame to decode
int current_loc_valid;
// per-blocksize precomputed data
// twiddle factors
float *A[2],*B[2],*C[2];
float *window[2];
uint16 *bit_reverse[2];
// current page/packet/segment streaming info
uint32 serial; // stream serial number for verification
int last_page;
int segment_count;
uint8 segments[255];
uint8 page_flag;
uint8 bytes_in_seg;
uint8 first_decode;
int next_seg;
int last_seg; // flag that we're on the last segment
int last_seg_which; // what was the segment number of the last seg?
uint32 acc;
int valid_bits;
int packet_bytes;
int end_seg_with_known_loc;
uint32 known_loc_for_packet;
int discard_samples_deferred;
uint32 samples_output;
// push mode scanning
int page_crc_tests; // only in push_mode: number of tests active; -1 if not searching
#ifndef STB_VORBIS_NO_PUSHDATA_API
CRCscan scan[STB_VORBIS_PUSHDATA_CRC_COUNT];
#endif
// sample-access
int channel_buffer_start;
int channel_buffer_end;
};
#if defined(STB_VORBIS_NO_PUSHDATA_API)
#define IS_PUSH_MODE(f) FALSE
#elif defined(STB_VORBIS_NO_PULLDATA_API)
#define IS_PUSH_MODE(f) TRUE
#else
#define IS_PUSH_MODE(f) ((f)->push_mode)
#endif
typedef struct stb_vorbis vorb;
static int error(vorb *f, enum STBVorbisError e)
{
f->error = e;
if (!f->eof && e != VORBIS_need_more_data) {
f->error=e; // breakpoint for debugging
}
return 0;
}
// these functions are used for allocating temporary memory
// while decoding. if you can afford the stack space, use
// alloca(); otherwise, provide a temp buffer and it will
// allocate out of those.
#define array_size_required(count,size) (count*(sizeof(void *)+(size)))
#define temp_alloc(f,size) (f->alloc.alloc_buffer ? setup_temp_malloc(f,size) : alloca(size))
#define temp_free(f,p) (void)0
#define temp_alloc_save(f) ((f)->temp_offset)
#define temp_alloc_restore(f,p) ((f)->temp_offset = (p))
#define temp_block_array(f,count,size) make_block_array(temp_alloc(f,array_size_required(count,size)), count, size)
// given a sufficiently large block of memory, make an array of pointers to subblocks of it
static void *make_block_array(void *mem, int count, int size)
{
int i;
void ** p = (void **) mem;
char *q = (char *) (p + count);
for (i=0; i < count; ++i) {
p[i] = q;
q += size;
}
return p;
}
static void *setup_malloc(vorb *f, int sz)
{
sz = (sz+7) & ~7; // round up to nearest 8 for alignment of future allocs.
f->setup_memory_required += sz;
if (f->alloc.alloc_buffer) {
void *p = (char *) f->alloc.alloc_buffer + f->setup_offset;
if (f->setup_offset + sz > f->temp_offset) return NULL;
f->setup_offset += sz;
return p;
}
return sz ? malloc(sz) : NULL;
}
static void setup_free(vorb *f, void *p)
{
if (f->alloc.alloc_buffer) return; // do nothing; setup mem is a stack
free(p);
}
static void *setup_temp_malloc(vorb *f, int sz)
{
sz = (sz+7) & ~7; // round up to nearest 8 for alignment of future allocs.
if (f->alloc.alloc_buffer) {
if (f->temp_offset - sz < f->setup_offset) return NULL;
f->temp_offset -= sz;
return (char *) f->alloc.alloc_buffer + f->temp_offset;
}
return malloc(sz);
}
static void setup_temp_free(vorb *f, void *p, int sz)
{
if (f->alloc.alloc_buffer) {
f->temp_offset += (sz+7)&~7;
return;
}
free(p);
}
#define CRC32_POLY 0x04c11db7 // from spec
static uint32 crc_table[256];
static void crc32_init(void)
{
int i,j;
uint32 s;
for(i=0; i < 256; i++) {
for (s=(uint32) i << 24, j=0; j < 8; ++j)
s = (s << 1) ^ (s >= (1U<<31) ? CRC32_POLY : 0);
crc_table[i] = s;
}
}
static __forceinline uint32 crc32_update(uint32 crc, uint8 byte)
{
return (crc << 8) ^ crc_table[byte ^ (crc >> 24)];
}
// used in setup, and for huffman that doesn't go fast path
static unsigned int bit_reverse(unsigned int n)
{
n = ((n & 0xAAAAAAAA) >> 1) | ((n & 0x55555555) << 1);
n = ((n & 0xCCCCCCCC) >> 2) | ((n & 0x33333333) << 2);
n = ((n & 0xF0F0F0F0) >> 4) | ((n & 0x0F0F0F0F) << 4);
n = ((n & 0xFF00FF00) >> 8) | ((n & 0x00FF00FF) << 8);
return (n >> 16) | (n << 16);
}
static float square(float x)
{
return x*x;
}
// this is a weird definition of log2() for which log2(1) = 1, log2(2) = 2, log2(4) = 3
// as required by the specification. fast(?) implementation from stb.h
// @OPTIMIZE: called multiple times per-packet with "constants"; move to setup
static int ilog(int32 n)
{
static signed char log2_4[16] = { 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4 };
if (n < 0) return 0; // signed n returns 0
// 2 compares if n < 16, 3 compares otherwise (4 if signed or n > 1<<29)
if (n < (1 << 14))
if (n < (1 << 4)) return 0 + log2_4[n ];
else if (n < (1 << 9)) return 5 + log2_4[n >> 5];
else return 10 + log2_4[n >> 10];
else if (n < (1 << 24))
if (n < (1 << 19)) return 15 + log2_4[n >> 15];
else return 20 + log2_4[n >> 20];
else if (n < (1 << 29)) return 25 + log2_4[n >> 25];
else return 30 + log2_4[n >> 30];
}
#ifndef M_PI
#define M_PI 3.14159265358979323846264f // from CRC
#endif
// code length assigned to a value with no huffman encoding
#define NO_CODE 255
/////////////////////// LEAF SETUP FUNCTIONS //////////////////////////
//
// these functions are only called at setup, and only a few times
// per file
static float float32_unpack(uint32 x)
{
// from the specification
uint32 mantissa = x & 0x1fffff;
uint32 sign = x & 0x80000000;
uint32 exp = (x & 0x7fe00000) >> 21;
double res = sign ? -(double)mantissa : (double)mantissa;
return (float) ldexp((float)res, exp-788);
}
// zlib & jpeg huffman tables assume that the output symbols
// can either be arbitrarily arranged, or have monotonically
// increasing frequencies--they rely on the lengths being sorted;
// this makes for a very simple generation algorithm.
// vorbis allows a huffman table with non-sorted lengths. This
// requires a more sophisticated construction, since symbols in
// order do not map to huffman codes "in order".
static void add_entry(Codebook *c, uint32 huff_code, int symbol, int count, int len, uint32 *values)
{
if (!c->sparse) {
c->codewords [symbol] = huff_code;
} else {
c->codewords [count] = huff_code;
c->codeword_lengths[count] = len;
values [count] = symbol;
}
}
static int compute_codewords(Codebook *c, uint8 *len, int n, uint32 *values)
{
int i,k,m=0;
uint32 available[32];
memset(available, 0, sizeof(available));
// find the first entry
for (k=0; k < n; ++k) if (len[k] < NO_CODE) break;
if (k == n) { assert(c->sorted_entries == 0); return TRUE; }
// add to the list
add_entry(c, 0, k, m++, len[k], values);
// add all available leaves
for (i=1; i <= len[k]; ++i)
available[i] = 1U << (32-i);
// note that the above code treats the first case specially,
// but it's really the same as the following code, so they
// could probably be combined (except the initial code is 0,
// and I use 0 in available[] to mean 'empty')
for (i=k+1; i < n; ++i) {
uint32 res;
int z = len[i], y;
if (z == NO_CODE) continue;
// find lowest available leaf (should always be earliest,
// which is what the specification calls for)
// note that this property, and the fact we can never have
// more than one free leaf at a given level, isn't totally
// trivial to prove, but it seems true and the assert never
// fires, so!
while (z > 0 && !available[z]) --z;
if (z == 0) { return FALSE; }
res = available[z];
assert(z >= 0 && z < 32);
available[z] = 0;
add_entry(c, bit_reverse(res), i, m++, len[i], values);
// propagate availability up the tree
if (z != len[i]) {
assert(len[i] >= 0 && len[i] < 32);
for (y=len[i]; y > z; --y) {
assert(available[y] == 0);
available[y] = res + (1 << (32-y));
}
}
}
return TRUE;
}
// accelerated huffman table allows fast O(1) match of all symbols
// of length <= STB_VORBIS_FAST_HUFFMAN_LENGTH
static void compute_accelerated_huffman(Codebook *c)
{
int i, len;
for (i=0; i < FAST_HUFFMAN_TABLE_SIZE; ++i)
c->fast_huffman[i] = -1;
len = c->sparse ? c->sorted_entries : c->entries;
#ifdef STB_VORBIS_FAST_HUFFMAN_SHORT
if (len > 32767) len = 32767; // largest possible value we can encode!
#endif
for (i=0; i < len; ++i) {
if (c->codeword_lengths[i] <= STB_VORBIS_FAST_HUFFMAN_LENGTH) {
uint32 z = c->sparse ? bit_reverse(c->sorted_codewords[i]) : c->codewords[i];
// set table entries for all bit combinations in the higher bits
while (z < FAST_HUFFMAN_TABLE_SIZE) {
c->fast_huffman[z] = i;
z += 1 << c->codeword_lengths[i];
}
}
}
}
#ifdef _MSC_VER
#define STBV_CDECL __cdecl
#else
#define STBV_CDECL
#endif
static int STBV_CDECL uint32_compare(const void *p, const void *q)
{
uint32 x = * (uint32 *) p;
uint32 y = * (uint32 *) q;
return x < y ? -1 : x > y;
}
static int include_in_sort(Codebook *c, uint8 len)
{
if (c->sparse) { assert(len != NO_CODE); return TRUE; }
if (len == NO_CODE) return FALSE;
if (len > STB_VORBIS_FAST_HUFFMAN_LENGTH) return TRUE;
return FALSE;
}
// if the fast table above doesn't work, we want to binary
// search them... need to reverse the bits
static void compute_sorted_huffman(Codebook *c, uint8 *lengths, uint32 *values)
{
int i, len;
// build a list of all the entries
// OPTIMIZATION: don't include the short ones, since they'll be caught by FAST_HUFFMAN.
// this is kind of a frivolous optimization--I don't see any performance improvement,
// but it's like 4 extra lines of code, so.
if (!c->sparse) {
int k = 0;
for (i=0; i < c->entries; ++i)
if (include_in_sort(c, lengths[i]))
c->sorted_codewords[k++] = bit_reverse(c->codewords[i]);
assert(k == c->sorted_entries);
} else {
for (i=0; i < c->sorted_entries; ++i)
c->sorted_codewords[i] = bit_reverse(c->codewords[i]);
}
qsort(c->sorted_codewords, c->sorted_entries, sizeof(c->sorted_codewords[0]), uint32_compare);
c->sorted_codewords[c->sorted_entries] = 0xffffffff;
len = c->sparse ? c->sorted_entries : c->entries;
// now we need to indicate how they correspond; we could either
// #1: sort a different data structure that says who they correspond to
// #2: for each sorted entry, search the original list to find who corresponds
// #3: for each original entry, find the sorted entry
// #1 requires extra storage, #2 is slow, #3 can use binary search!
for (i=0; i < len; ++i) {
int huff_len = c->sparse ? lengths[values[i]] : lengths[i];
if (include_in_sort(c,huff_len)) {
uint32 code = bit_reverse(c->codewords[i]);
int x=0, n=c->sorted_entries;
while (n > 1) {
// invariant: sc[x] <= code < sc[x+n]
int m = x + (n >> 1);
if (c->sorted_codewords[m] <= code) {
x = m;
n -= (n>>1);
} else {
n >>= 1;
}
}
assert(c->sorted_codewords[x] == code);
if (c->sparse) {
c->sorted_values[x] = values[i];
c->codeword_lengths[x] = huff_len;
} else {
c->sorted_values[x] = i;
}
}
}
}
// only run while parsing the header (3 times)
static int vorbis_validate(uint8 *data)
{
static uint8 vorbis[6] = { 'v', 'o', 'r', 'b', 'i', 's' };
return memcmp(data, vorbis, 6) == 0;
}
// called from setup only, once per code book
// (formula implied by specification)
static int lookup1_values(int entries, int dim)
{
int r = (int) floor(exp((float) log((float) entries) / dim));
if ((int) floor(pow((float) r+1, dim)) <= entries) // (int) cast for MinGW warning;
++r; // floor() to avoid _ftol() when non-CRT
if (pow((float) r+1, dim) <= entries)
return -1;
if ((int) floor(pow((float) r, dim)) > entries)
return -1;
return r;
}
// called twice per file
static void compute_twiddle_factors(int n, float *A, float *B, float *C)
{
int n4 = n >> 2, n8 = n >> 3;
int k,k2;
for (k=k2=0; k < n4; ++k,k2+=2) {
A[k2 ] = (float) cos(4*k*M_PI/n);
A[k2+1] = (float) -sin(4*k*M_PI/n);
B[k2 ] = (float) cos((k2+1)*M_PI/n/2) * 0.5f;
B[k2+1] = (float) sin((k2+1)*M_PI/n/2) * 0.5f;
}
for (k=k2=0; k < n8; ++k,k2+=2) {
C[k2 ] = (float) cos(2*(k2+1)*M_PI/n);
C[k2+1] = (float) -sin(2*(k2+1)*M_PI/n);
}
}
static void compute_window(int n, float *window)
{
int n2 = n >> 1, i;
for (i=0; i < n2; ++i)
window[i] = (float) sin(0.5 * M_PI * square((float) sin((i - 0 + 0.5) / n2 * 0.5 * M_PI)));
}
static void compute_bitreverse(int n, uint16 *rev)
{
int ld = ilog(n) - 1; // ilog is off-by-one from normal definitions
int i, n8 = n >> 3;
for (i=0; i < n8; ++i)
rev[i] = (bit_reverse(i) >> (32-ld+3)) << 2;
}
static int init_blocksize(vorb *f, int b, int n)
{
int n2 = n >> 1, n4 = n >> 2, n8 = n >> 3;
f->A[b] = (float *) setup_malloc(f, sizeof(float) * n2);
f->B[b] = (float *) setup_malloc(f, sizeof(float) * n2);
f->C[b] = (float *) setup_malloc(f, sizeof(float) * n4);
if (!f->A[b] || !f->B[b] || !f->C[b]) return error(f, VORBIS_outofmem);
compute_twiddle_factors(n, f->A[b], f->B[b], f->C[b]);
f->window[b] = (float *) setup_malloc(f, sizeof(float) * n2);
if (!f->window[b]) return error(f, VORBIS_outofmem);
compute_window(n, f->window[b]);
f->bit_reverse[b] = (uint16 *) setup_malloc(f, sizeof(uint16) * n8);
if (!f->bit_reverse[b]) return error(f, VORBIS_outofmem);
compute_bitreverse(n, f->bit_reverse[b]);
return TRUE;
}
static void neighbors(uint16 *x, int n, int *plow, int *phigh)
{
int low = -1;
int high = 65536;
int i;
for (i=0; i < n; ++i) {
if (x[i] > low && x[i] < x[n]) { *plow = i; low = x[i]; }
if (x[i] < high && x[i] > x[n]) { *phigh = i; high = x[i]; }
}
}
// this has been repurposed so y is now the original index instead of y
typedef struct
{
uint16 x,id;
} stbv__floor_ordering;
static int STBV_CDECL point_compare(const void *p, const void *q)
{
stbv__floor_ordering *a = (stbv__floor_ordering *) p;
stbv__floor_ordering *b = (stbv__floor_ordering *) q;
return a->x < b->x ? -1 : a->x > b->x;
}
//
/////////////////////// END LEAF SETUP FUNCTIONS //////////////////////////
#if defined(STB_VORBIS_NO_STDIO)
#define USE_MEMORY(z) TRUE
#else
#define USE_MEMORY(z) ((z)->stream)
#endif
static uint8 get8(vorb *z)
{
if (USE_MEMORY(z)) {
if (z->stream >= z->stream_end) { z->eof = TRUE; return 0; }
return *z->stream++;
}
#ifndef STB_VORBIS_NO_STDIO
{
int c = fgetc(z->f);
if (c == EOF) { z->eof = TRUE; return 0; }
return c;
}
#endif
}
static uint32 get32(vorb *f)
{
uint32 x;
x = get8(f);
x += get8(f) << 8;
x += get8(f) << 16;
x += (uint32) get8(f) << 24;
return x;
}
static int getn(vorb *z, uint8 *data, int n)
{
if (USE_MEMORY(z)) {
if (z->stream+n > z->stream_end) { z->eof = 1; return 0; }
memcpy(data, z->stream, n);
z->stream += n;
return 1;
}
#ifndef STB_VORBIS_NO_STDIO
if (fread(data, n, 1, z->f) == 1)
return 1;
else {
z->eof = 1;
return 0;
}
#endif
}
static void skip(vorb *z, int n)
{
if (USE_MEMORY(z)) {
z->stream += n;
if (z->stream >= z->stream_end) z->eof = 1;
return;
}
#ifndef STB_VORBIS_NO_STDIO
{
long x = ftell(z->f);
fseek(z->f, x+n, SEEK_SET);
}
#endif
}
static int set_file_offset(stb_vorbis *f, unsigned int loc)
{
#ifndef STB_VORBIS_NO_PUSHDATA_API
if (f->push_mode) return 0;
#endif
f->eof = 0;
if (USE_MEMORY(f)) {
if (f->stream_start + loc >= f->stream_end || f->stream_start + loc < f->stream_start) {
f->stream = f->stream_end;
f->eof = 1;
return 0;
} else {
f->stream = f->stream_start + loc;
return 1;
}
}
#ifndef STB_VORBIS_NO_STDIO
if (loc + f->f_start < loc || loc >= 0x80000000) {
loc = 0x7fffffff;
f->eof = 1;
} else {
loc += f->f_start;
}
if (!fseek(f->f, loc, SEEK_SET))
return 1;
f->eof = 1;
fseek(f->f, f->f_start, SEEK_END);
return 0;
#endif
}
static uint8 ogg_page_header[4] = { 0x4f, 0x67, 0x67, 0x53 };
static int capture_pattern(vorb *f)
{
if (0x4f != get8(f)) return FALSE;
if (0x67 != get8(f)) return FALSE;
if (0x67 != get8(f)) return FALSE;
if (0x53 != get8(f)) return FALSE;
return TRUE;
}
#define PAGEFLAG_continued_packet 1
#define PAGEFLAG_first_page 2
#define PAGEFLAG_last_page 4
static int start_page_no_capturepattern(vorb *f)
{
uint32 loc0,loc1,n;
if (f->first_decode && !IS_PUSH_MODE(f)) {
f->p_first.page_start = stb_vorbis_get_file_offset(f) - 4;
}
// stream structure version
if (0 != get8(f)) return error(f, VORBIS_invalid_stream_structure_version);
// header flag
f->page_flag = get8(f);
// absolute granule position
loc0 = get32(f);
loc1 = get32(f);
// @TODO: validate loc0,loc1 as valid positions?
// stream serial number -- vorbis doesn't interleave, so discard
get32(f);
//if (f->serial != get32(f)) return error(f, VORBIS_incorrect_stream_serial_number);
// page sequence number
n = get32(f);
f->last_page = n;
// CRC32
get32(f);
// page_segments
f->segment_count = get8(f);
if (!getn(f, f->segments, f->segment_count))
return error(f, VORBIS_unexpected_eof);
// assume we _don't_ know any the sample position of any segments
f->end_seg_with_known_loc = -2;
if (loc0 != ~0U || loc1 != ~0U) {
int i;
// determine which packet is the last one that will complete
for (i=f->segment_count-1; i >= 0; --i)
if (f->segments[i] < 255)
break;
// 'i' is now the index of the _last_ segment of a packet that ends
if (i >= 0) {
f->end_seg_with_known_loc = i;
f->known_loc_for_packet = loc0;
}
}
if (f->first_decode) {
int i,len;
len = 0;
for (i=0; i < f->segment_count; ++i)
len += f->segments[i];
len += 27 + f->segment_count;
f->p_first.page_end = f->p_first.page_start + len;
f->p_first.last_decoded_sample = loc0;
}
f->next_seg = 0;
return TRUE;
}
static int start_page(vorb *f)
{
if (!capture_pattern(f)) return error(f, VORBIS_missing_capture_pattern);
return start_page_no_capturepattern(f);
}
static int start_packet(vorb *f)
{
while (f->next_seg == -1) {
if (!start_page(f)) return FALSE;
if (f->page_flag & PAGEFLAG_continued_packet)
return error(f, VORBIS_continued_packet_flag_invalid);
}
f->last_seg = FALSE;
f->valid_bits = 0;
f->packet_bytes = 0;
f->bytes_in_seg = 0;
// f->next_seg is now valid
return TRUE;
}
static int maybe_start_packet(vorb *f)
{
if (f->next_seg == -1) {
int x = get8(f);
if (f->eof) return FALSE; // EOF at page boundary is not an error!
if (0x4f != x ) return error(f, VORBIS_missing_capture_pattern);
if (0x67 != get8(f)) return error(f, VORBIS_missing_capture_pattern);
if (0x67 != get8(f)) return error(f, VORBIS_missing_capture_pattern);
if (0x53 != get8(f)) return error(f, VORBIS_missing_capture_pattern);
if (!start_page_no_capturepattern(f)) return FALSE;
if (f->page_flag & PAGEFLAG_continued_packet) {
// set up enough state that we can read this packet if we want,
// e.g. during recovery
f->last_seg = FALSE;
f->bytes_in_seg = 0;
return error(f, VORBIS_continued_packet_flag_invalid);
}
}
return start_packet(f);
}
static int next_segment(vorb *f)
{
int len;
if (f->last_seg) return 0;
if (f->next_seg == -1) {
f->last_seg_which = f->segment_count-1; // in case start_page fails
if (!start_page(f)) { f->last_seg = 1; return 0; }
if (!(f->page_flag & PAGEFLAG_continued_packet)) return error(f, VORBIS_continued_packet_flag_invalid);
}
len = f->segments[f->next_seg++];
if (len < 255) {
f->last_seg = TRUE;
f->last_seg_which = f->next_seg-1;
}
if (f->next_seg >= f->segment_count)
f->next_seg = -1;
assert(f->bytes_in_seg == 0);
f->bytes_in_seg = len;
return len;
}
#define EOP (-1)
#define INVALID_BITS (-1)
static int get8_packet_raw(vorb *f)
{
if (!f->bytes_in_seg) { // CLANG!
if (f->last_seg) return EOP;
else if (!next_segment(f)) return EOP;
}
assert(f->bytes_in_seg > 0);
--f->bytes_in_seg;
++f->packet_bytes;
return get8(f);
}
static int get8_packet(vorb *f)
{
int x = get8_packet_raw(f);
f->valid_bits = 0;
return x;
}
static int get32_packet(vorb *f)
{
uint32 x;
x = get8_packet(f);
x += get8_packet(f) << 8;
x += get8_packet(f) << 16;
x += (uint32) get8_packet(f) << 24;
return x;
}
static void flush_packet(vorb *f)
{
while (get8_packet_raw(f) != EOP);
}
// @OPTIMIZE: this is the secondary bit decoder, so it's probably not as important
// as the huffman decoder?
static uint32 get_bits(vorb *f, int n)
{
uint32 z;
if (f->valid_bits < 0) return 0;
if (f->valid_bits < n) {
if (n > 24) {
// the accumulator technique below would not work correctly in this case
z = get_bits(f, 24);
z += get_bits(f, n-24) << 24;
return z;
}
if (f->valid_bits == 0) f->acc = 0;
while (f->valid_bits < n) {
int z = get8_packet_raw(f);
if (z == EOP) {
f->valid_bits = INVALID_BITS;
return 0;
}
f->acc += z << f->valid_bits;
f->valid_bits += 8;
}
}
assert(f->valid_bits >= n);
z = f->acc & ((1 << n)-1);
f->acc >>= n;
f->valid_bits -= n;
return z;
}
// @OPTIMIZE: primary accumulator for huffman
// expand the buffer to as many bits as possible without reading off end of packet
// it might be nice to allow f->valid_bits and f->acc to be stored in registers,
// e.g. cache them locally and decode locally
static __forceinline void prep_huffman(vorb *f)
{
if (f->valid_bits <= 24) {
if (f->valid_bits == 0) f->acc = 0;
do {
int z;
if (f->last_seg && !f->bytes_in_seg) return;
z = get8_packet_raw(f);
if (z == EOP) return;
f->acc += (unsigned) z << f->valid_bits;
f->valid_bits += 8;
} while (f->valid_bits <= 24);
}
}
enum
{
VORBIS_packet_id = 1,
VORBIS_packet_comment = 3,
VORBIS_packet_setup = 5
};
static int codebook_decode_scalar_raw(vorb *f, Codebook *c)
{
int i;
prep_huffman(f);
if (c->codewords == NULL && c->sorted_codewords == NULL)
return -1;
// cases to use binary search: sorted_codewords && !c->codewords
// sorted_codewords && c->entries > 8
if (c->entries > 8 ? c->sorted_codewords!=NULL : !c->codewords) {
// binary search
uint32 code = bit_reverse(f->acc);
int x=0, n=c->sorted_entries, len;
while (n > 1) {
// invariant: sc[x] <= code < sc[x+n]
int m = x + (n >> 1);
if (c->sorted_codewords[m] <= code) {
x = m;
n -= (n>>1);
} else {
n >>= 1;
}
}
// x is now the sorted index
if (!c->sparse) x = c->sorted_values[x];
// x is now sorted index if sparse, or symbol otherwise
len = c->codeword_lengths[x];
if (f->valid_bits >= len) {
f->acc >>= len;
f->valid_bits -= len;
return x;
}
f->valid_bits = 0;
return -1;
}
// if small, linear search
assert(!c->sparse);
for (i=0; i < c->entries; ++i) {
if (c->codeword_lengths[i] == NO_CODE) continue;
if (c->codewords[i] == (f->acc & ((1 << c->codeword_lengths[i])-1))) {
if (f->valid_bits >= c->codeword_lengths[i]) {
f->acc >>= c->codeword_lengths[i];
f->valid_bits -= c->codeword_lengths[i];
return i;
}
f->valid_bits = 0;
return -1;
}
}
error(f, VORBIS_invalid_stream);
f->valid_bits = 0;
return -1;
}
#ifndef STB_VORBIS_NO_INLINE_DECODE
#define DECODE_RAW(var, f,c) \
if (f->valid_bits < STB_VORBIS_FAST_HUFFMAN_LENGTH) \
prep_huffman(f); \
var = f->acc & FAST_HUFFMAN_TABLE_MASK; \
var = c->fast_huffman[var]; \
if (var >= 0) { \
int n = c->codeword_lengths[var]; \
f->acc >>= n; \
f->valid_bits -= n; \
if (f->valid_bits < 0) { f->valid_bits = 0; var = -1; } \
} else { \
var = codebook_decode_scalar_raw(f,c); \
}
#else
static int codebook_decode_scalar(vorb *f, Codebook *c)
{
int i;
if (f->valid_bits < STB_VORBIS_FAST_HUFFMAN_LENGTH)
prep_huffman(f);
// fast huffman table lookup
i = f->acc & FAST_HUFFMAN_TABLE_MASK;
i = c->fast_huffman[i];
if (i >= 0) {
f->acc >>= c->codeword_lengths[i];
f->valid_bits -= c->codeword_lengths[i];
if (f->valid_bits < 0) { f->valid_bits = 0; return -1; }
return i;
}
return codebook_decode_scalar_raw(f,c);
}
#define DECODE_RAW(var,f,c) var = codebook_decode_scalar(f,c);
#endif
#define DECODE(var,f,c) \
DECODE_RAW(var,f,c) \
if (c->sparse) var = c->sorted_values[var];
#ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK
#define DECODE_VQ(var,f,c) DECODE_RAW(var,f,c)
#else
#define DECODE_VQ(var,f,c) DECODE(var,f,c)
#endif
// CODEBOOK_ELEMENT_FAST is an optimization for the CODEBOOK_FLOATS case
// where we avoid one addition
#define CODEBOOK_ELEMENT(c,off) (c->multiplicands[off])
#define CODEBOOK_ELEMENT_FAST(c,off) (c->multiplicands[off])
#define CODEBOOK_ELEMENT_BASE(c) (0)
static int codebook_decode_start(vorb *f, Codebook *c)
{
int z = -1;
// type 0 is only legal in a scalar context
if (c->lookup_type == 0)
error(f, VORBIS_invalid_stream);
else {
DECODE_VQ(z,f,c);
if (c->sparse) assert(z < c->sorted_entries);
if (z < 0) { // check for EOP
if (!f->bytes_in_seg)
if (f->last_seg)
return z;
error(f, VORBIS_invalid_stream);
}
}
return z;
}
static int codebook_decode(vorb *f, Codebook *c, float *output, int len)
{
int i,z = codebook_decode_start(f,c);
if (z < 0) return FALSE;
if (len > c->dimensions) len = c->dimensions;
#ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK
if (c->lookup_type == 1) {
float last = CODEBOOK_ELEMENT_BASE(c);
int div = 1;
for (i=0; i < len; ++i) {
int off = (z / div) % c->lookup_values;
float val = CODEBOOK_ELEMENT_FAST(c,off) + last;
output[i] += val;
if (c->sequence_p) last = val + c->minimum_value;
div *= c->lookup_values;
}
return TRUE;
}
#endif
z *= c->dimensions;
if (c->sequence_p) {
float last = CODEBOOK_ELEMENT_BASE(c);
for (i=0; i < len; ++i) {
float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last;
output[i] += val;
last = val + c->minimum_value;
}
} else {
float last = CODEBOOK_ELEMENT_BASE(c);
for (i=0; i < len; ++i) {
output[i] += CODEBOOK_ELEMENT_FAST(c,z+i) + last;
}
}
return TRUE;
}
static int codebook_decode_step(vorb *f, Codebook *c, float *output, int len, int step)
{
int i,z = codebook_decode_start(f,c);
float last = CODEBOOK_ELEMENT_BASE(c);
if (z < 0) return FALSE;
if (len > c->dimensions) len = c->dimensions;
#ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK
if (c->lookup_type == 1) {
int div = 1;
for (i=0; i < len; ++i) {
int off = (z / div) % c->lookup_values;
float val = CODEBOOK_ELEMENT_FAST(c,off) + last;
output[i*step] += val;
if (c->sequence_p) last = val;
div *= c->lookup_values;
}
return TRUE;
}
#endif
z *= c->dimensions;
for (i=0; i < len; ++i) {
float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last;
output[i*step] += val;
if (c->sequence_p) last = val;
}
return TRUE;
}
static int codebook_decode_deinterleave_repeat(vorb *f, Codebook *c, float **outputs, int ch, int *c_inter_p, int *p_inter_p, int len, int total_decode)
{
int c_inter = *c_inter_p;
int p_inter = *p_inter_p;
int i,z, effective = c->dimensions;
// type 0 is only legal in a scalar context
if (c->lookup_type == 0) return error(f, VORBIS_invalid_stream);
while (total_decode > 0) {
float last = CODEBOOK_ELEMENT_BASE(c);
DECODE_VQ(z,f,c);
#ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK
assert(!c->sparse || z < c->sorted_entries);
#endif
if (z < 0) {
if (!f->bytes_in_seg)
if (f->last_seg) return FALSE;
return error(f, VORBIS_invalid_stream);
}
// if this will take us off the end of the buffers, stop short!
// we check by computing the length of the virtual interleaved
// buffer (len*ch), our current offset within it (p_inter*ch)+(c_inter),
// and the length we'll be using (effective)
if (c_inter + p_inter*ch + effective > len * ch) {
effective = len*ch - (p_inter*ch - c_inter);
}
#ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK
if (c->lookup_type == 1) {
int div = 1;
for (i=0; i < effective; ++i) {
int off = (z / div) % c->lookup_values;
float val = CODEBOOK_ELEMENT_FAST(c,off) + last;
if (outputs[c_inter])
outputs[c_inter][p_inter] += val;
if (++c_inter == ch) { c_inter = 0; ++p_inter; }
if (c->sequence_p) last = val;
div *= c->lookup_values;
}
} else
#endif
{
z *= c->dimensions;
if (c->sequence_p) {
for (i=0; i < effective; ++i) {
float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last;
if (outputs[c_inter])
outputs[c_inter][p_inter] += val;
if (++c_inter == ch) { c_inter = 0; ++p_inter; }
last = val;
}
} else {
for (i=0; i < effective; ++i) {
float val = CODEBOOK_ELEMENT_FAST(c,z+i) + last;
if (outputs[c_inter])
outputs[c_inter][p_inter] += val;
if (++c_inter == ch) { c_inter = 0; ++p_inter; }
}
}
}
total_decode -= effective;
}
*c_inter_p = c_inter;
*p_inter_p = p_inter;
return TRUE;
}
static int predict_point(int x, int x0, int x1, int y0, int y1)
{
int dy = y1 - y0;
int adx = x1 - x0;
// @OPTIMIZE: force int division to round in the right direction... is this necessary on x86?
int err = abs(dy) * (x - x0);
int off = err / adx;
return dy < 0 ? y0 - off : y0 + off;
}
// the following table is block-copied from the specification
static float inverse_db_table[256] =
{
1.0649863e-07f, 1.1341951e-07f, 1.2079015e-07f, 1.2863978e-07f,
1.3699951e-07f, 1.4590251e-07f, 1.5538408e-07f, 1.6548181e-07f,
1.7623575e-07f, 1.8768855e-07f, 1.9988561e-07f, 2.1287530e-07f,
2.2670913e-07f, 2.4144197e-07f, 2.5713223e-07f, 2.7384213e-07f,
2.9163793e-07f, 3.1059021e-07f, 3.3077411e-07f, 3.5226968e-07f,
3.7516214e-07f, 3.9954229e-07f, 4.2550680e-07f, 4.5315863e-07f,
4.8260743e-07f, 5.1396998e-07f, 5.4737065e-07f, 5.8294187e-07f,
6.2082472e-07f, 6.6116941e-07f, 7.0413592e-07f, 7.4989464e-07f,
7.9862701e-07f, 8.5052630e-07f, 9.0579828e-07f, 9.6466216e-07f,
1.0273513e-06f, 1.0941144e-06f, 1.1652161e-06f, 1.2409384e-06f,
1.3215816e-06f, 1.4074654e-06f, 1.4989305e-06f, 1.5963394e-06f,
1.7000785e-06f, 1.8105592e-06f, 1.9282195e-06f, 2.0535261e-06f,
2.1869758e-06f, 2.3290978e-06f, 2.4804557e-06f, 2.6416497e-06f,
2.8133190e-06f, 2.9961443e-06f, 3.1908506e-06f, 3.3982101e-06f,
3.6190449e-06f, 3.8542308e-06f, 4.1047004e-06f, 4.3714470e-06f,
4.6555282e-06f, 4.9580707e-06f, 5.2802740e-06f, 5.6234160e-06f,
5.9888572e-06f, 6.3780469e-06f, 6.7925283e-06f, 7.2339451e-06f,
7.7040476e-06f, 8.2047000e-06f, 8.7378876e-06f, 9.3057248e-06f,
9.9104632e-06f, 1.0554501e-05f, 1.1240392e-05f, 1.1970856e-05f,
1.2748789e-05f, 1.3577278e-05f, 1.4459606e-05f, 1.5399272e-05f,
1.6400004e-05f, 1.7465768e-05f, 1.8600792e-05f, 1.9809576e-05f,
2.1096914e-05f, 2.2467911e-05f, 2.3928002e-05f, 2.5482978e-05f,
2.7139006e-05f, 2.8902651e-05f, 3.0780908e-05f, 3.2781225e-05f,
3.4911534e-05f, 3.7180282e-05f, 3.9596466e-05f, 4.2169667e-05f,
4.4910090e-05f, 4.7828601e-05f, 5.0936773e-05f, 5.4246931e-05f,
5.7772202e-05f, 6.1526565e-05f, 6.5524908e-05f, 6.9783085e-05f,
7.4317983e-05f, 7.9147585e-05f, 8.4291040e-05f, 8.9768747e-05f,
9.5602426e-05f, 0.00010181521f, 0.00010843174f, 0.00011547824f,
0.00012298267f, 0.00013097477f, 0.00013948625f, 0.00014855085f,
0.00015820453f, 0.00016848555f, 0.00017943469f, 0.00019109536f,
0.00020351382f, 0.00021673929f, 0.00023082423f, 0.00024582449f,
0.00026179955f, 0.00027881276f, 0.00029693158f, 0.00031622787f,
0.00033677814f, 0.00035866388f, 0.00038197188f, 0.00040679456f,
0.00043323036f, 0.00046138411f, 0.00049136745f, 0.00052329927f,
0.00055730621f, 0.00059352311f, 0.00063209358f, 0.00067317058f,
0.00071691700f, 0.00076350630f, 0.00081312324f, 0.00086596457f,
0.00092223983f, 0.00098217216f, 0.0010459992f, 0.0011139742f,
0.0011863665f, 0.0012634633f, 0.0013455702f, 0.0014330129f,
0.0015261382f, 0.0016253153f, 0.0017309374f, 0.0018434235f,
0.0019632195f, 0.0020908006f, 0.0022266726f, 0.0023713743f,
0.0025254795f, 0.0026895994f, 0.0028643847f, 0.0030505286f,
0.0032487691f, 0.0034598925f, 0.0036847358f, 0.0039241906f,
0.0041792066f, 0.0044507950f, 0.0047400328f, 0.0050480668f,
0.0053761186f, 0.0057254891f, 0.0060975636f, 0.0064938176f,
0.0069158225f, 0.0073652516f, 0.0078438871f, 0.0083536271f,
0.0088964928f, 0.009474637f, 0.010090352f, 0.010746080f,
0.011444421f, 0.012188144f, 0.012980198f, 0.013823725f,
0.014722068f, 0.015678791f, 0.016697687f, 0.017782797f,
0.018938423f, 0.020169149f, 0.021479854f, 0.022875735f,
0.024362330f, 0.025945531f, 0.027631618f, 0.029427276f,
0.031339626f, 0.033376252f, 0.035545228f, 0.037855157f,
0.040315199f, 0.042935108f, 0.045725273f, 0.048696758f,
0.051861348f, 0.055231591f, 0.058820850f, 0.062643361f,
0.066714279f, 0.071049749f, 0.075666962f, 0.080584227f,
0.085821044f, 0.091398179f, 0.097337747f, 0.10366330f,
0.11039993f, 0.11757434f, 0.12521498f, 0.13335215f,
0.14201813f, 0.15124727f, 0.16107617f, 0.17154380f,
0.18269168f, 0.19456402f, 0.20720788f, 0.22067342f,
0.23501402f, 0.25028656f, 0.26655159f, 0.28387361f,
0.30232132f, 0.32196786f, 0.34289114f, 0.36517414f,
0.38890521f, 0.41417847f, 0.44109412f, 0.46975890f,
0.50028648f, 0.53279791f, 0.56742212f, 0.60429640f,
0.64356699f, 0.68538959f, 0.72993007f, 0.77736504f,
0.82788260f, 0.88168307f, 0.9389798f, 1.0f
};
// @OPTIMIZE: if you want to replace this bresenham line-drawing routine,
// note that you must produce bit-identical output to decode correctly;
// this specific sequence of operations is specified in the spec (it's
// drawing integer-quantized frequency-space lines that the encoder
// expects to be exactly the same)
// ... also, isn't the whole point of Bresenham's algorithm to NOT
// have to divide in the setup? sigh.
#ifndef STB_VORBIS_NO_DEFER_FLOOR
#define LINE_OP(a,b) a *= b
#else
#define LINE_OP(a,b) a = b
#endif
#ifdef STB_VORBIS_DIVIDE_TABLE
#define DIVTAB_NUMER 32
#define DIVTAB_DENOM 64
int8 integer_divide_table[DIVTAB_NUMER][DIVTAB_DENOM]; // 2KB
#endif
static __forceinline void draw_line(float *output, int x0, int y0, int x1, int y1, int n)
{
int dy = y1 - y0;
int adx = x1 - x0;
int ady = abs(dy);
int base;
int x=x0,y=y0;
int err = 0;
int sy;
#ifdef STB_VORBIS_DIVIDE_TABLE
if (adx < DIVTAB_DENOM && ady < DIVTAB_NUMER) {
if (dy < 0) {
base = -integer_divide_table[ady][adx];
sy = base-1;
} else {
base = integer_divide_table[ady][adx];
sy = base+1;
}
} else {
base = dy / adx;
if (dy < 0)
sy = base - 1;
else
sy = base+1;
}
#else
base = dy / adx;
if (dy < 0)
sy = base - 1;
else
sy = base+1;
#endif
ady -= abs(base) * adx;
if (x1 > n) x1 = n;
if (x < x1) {
LINE_OP(output[x], inverse_db_table[y&255]);
for (++x; x < x1; ++x) {
err += ady;
if (err >= adx) {
err -= adx;
y += sy;
} else
y += base;
LINE_OP(output[x], inverse_db_table[y&255]);
}
}
}
static int residue_decode(vorb *f, Codebook *book, float *target, int offset, int n, int rtype)
{
int k;
if (rtype == 0) {
int step = n / book->dimensions;
for (k=0; k < step; ++k)
if (!codebook_decode_step(f, book, target+offset+k, n-offset-k, step))
return FALSE;
} else {
for (k=0; k < n; ) {
if (!codebook_decode(f, book, target+offset, n-k))
return FALSE;
k += book->dimensions;
offset += book->dimensions;
}
}
return TRUE;
}
// n is 1/2 of the blocksize --
// specification: "Correct per-vector decode length is [n]/2"
static void decode_residue(vorb *f, float *residue_buffers[], int ch, int n, int rn, uint8 *do_not_decode)
{
int i,j,pass;
Residue *r = f->residue_config + rn;
int rtype = f->residue_types[rn];
int c = r->classbook;
int classwords = f->codebooks[c].dimensions;
unsigned int actual_size = rtype == 2 ? n*2 : n;
unsigned int limit_r_begin = (r->begin < actual_size ? r->begin : actual_size);
unsigned int limit_r_end = (r->end < actual_size ? r->end : actual_size);
int n_read = limit_r_end - limit_r_begin;
int part_read = n_read / r->part_size;
int temp_alloc_point = temp_alloc_save(f);
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
uint8 ***part_classdata = (uint8 ***) temp_block_array(f,f->channels, part_read * sizeof(**part_classdata));
#else
int **classifications = (int **) temp_block_array(f,f->channels, part_read * sizeof(**classifications));
#endif
CHECK(f);
for (i=0; i < ch; ++i)
if (!do_not_decode[i])
memset(residue_buffers[i], 0, sizeof(float) * n);
if (rtype == 2 && ch != 1) {
for (j=0; j < ch; ++j)
if (!do_not_decode[j])
break;
if (j == ch)
goto done;
for (pass=0; pass < 8; ++pass) {
int pcount = 0, class_set = 0;
if (ch == 2) {
while (pcount < part_read) {
int z = r->begin + pcount*r->part_size;
int c_inter = (z & 1), p_inter = z>>1;
if (pass == 0) {
Codebook *c = f->codebooks+r->classbook;
int q;
DECODE(q,f,c);
if (q == EOP) goto done;
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
part_classdata[0][class_set] = r->classdata[q];
#else
for (i=classwords-1; i >= 0; --i) {
classifications[0][i+pcount] = q % r->classifications;
q /= r->classifications;
}
#endif
}
for (i=0; i < classwords && pcount < part_read; ++i, ++pcount) {
int z = r->begin + pcount*r->part_size;
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
int c = part_classdata[0][class_set][i];
#else
int c = classifications[0][pcount];
#endif
int b = r->residue_books[c][pass];
if (b >= 0) {
Codebook *book = f->codebooks + b;
#ifdef STB_VORBIS_DIVIDES_IN_CODEBOOK
if (!codebook_decode_deinterleave_repeat(f, book, residue_buffers, ch, &c_inter, &p_inter, n, r->part_size))
goto done;
#else
// saves 1%
if (!codebook_decode_deinterleave_repeat(f, book, residue_buffers, ch, &c_inter, &p_inter, n, r->part_size))
goto done;
#endif
} else {
z += r->part_size;
c_inter = z & 1;
p_inter = z >> 1;
}
}
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
++class_set;
#endif
}
} else if (ch > 2) {
while (pcount < part_read) {
int z = r->begin + pcount*r->part_size;
int c_inter = z % ch, p_inter = z/ch;
if (pass == 0) {
Codebook *c = f->codebooks+r->classbook;
int q;
DECODE(q,f,c);
if (q == EOP) goto done;
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
part_classdata[0][class_set] = r->classdata[q];
#else
for (i=classwords-1; i >= 0; --i) {
classifications[0][i+pcount] = q % r->classifications;
q /= r->classifications;
}
#endif
}
for (i=0; i < classwords && pcount < part_read; ++i, ++pcount) {
int z = r->begin + pcount*r->part_size;
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
int c = part_classdata[0][class_set][i];
#else
int c = classifications[0][pcount];
#endif
int b = r->residue_books[c][pass];
if (b >= 0) {
Codebook *book = f->codebooks + b;
if (!codebook_decode_deinterleave_repeat(f, book, residue_buffers, ch, &c_inter, &p_inter, n, r->part_size))
goto done;
} else {
z += r->part_size;
c_inter = z % ch;
p_inter = z / ch;
}
}
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
++class_set;
#endif
}
}
}
goto done;
}
CHECK(f);
for (pass=0; pass < 8; ++pass) {
int pcount = 0, class_set=0;
while (pcount < part_read) {
if (pass == 0) {
for (j=0; j < ch; ++j) {
if (!do_not_decode[j]) {
Codebook *c = f->codebooks+r->classbook;
int temp;
DECODE(temp,f,c);
if (temp == EOP) goto done;
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
part_classdata[j][class_set] = r->classdata[temp];
#else
for (i=classwords-1; i >= 0; --i) {
classifications[j][i+pcount] = temp % r->classifications;
temp /= r->classifications;
}
#endif
}
}
}
for (i=0; i < classwords && pcount < part_read; ++i, ++pcount) {
for (j=0; j < ch; ++j) {
if (!do_not_decode[j]) {
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
int c = part_classdata[j][class_set][i];
#else
int c = classifications[j][pcount];
#endif
int b = r->residue_books[c][pass];
if (b >= 0) {
float *target = residue_buffers[j];
int offset = r->begin + pcount * r->part_size;
int n = r->part_size;
Codebook *book = f->codebooks + b;
if (!residue_decode(f, book, target, offset, n, rtype))
goto done;
}
}
}
}
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
++class_set;
#endif
}
}
done:
CHECK(f);
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
temp_free(f,part_classdata);
#else
temp_free(f,classifications);
#endif
temp_alloc_restore(f,temp_alloc_point);
}
#if 0
// slow way for debugging
void inverse_mdct_slow(float *buffer, int n)
{
int i,j;
int n2 = n >> 1;
float *x = (float *) malloc(sizeof(*x) * n2);
memcpy(x, buffer, sizeof(*x) * n2);
for (i=0; i < n; ++i) {
float acc = 0;
for (j=0; j < n2; ++j)
// formula from paper:
//acc += n/4.0f * x[j] * (float) cos(M_PI / 2 / n * (2 * i + 1 + n/2.0)*(2*j+1));
// formula from wikipedia
//acc += 2.0f / n2 * x[j] * (float) cos(M_PI/n2 * (i + 0.5 + n2/2)*(j + 0.5));
// these are equivalent, except the formula from the paper inverts the multiplier!
// however, what actually works is NO MULTIPLIER!?!
//acc += 64 * 2.0f / n2 * x[j] * (float) cos(M_PI/n2 * (i + 0.5 + n2/2)*(j + 0.5));
acc += x[j] * (float) cos(M_PI / 2 / n * (2 * i + 1 + n/2.0)*(2*j+1));
buffer[i] = acc;
}
free(x);
}
#elif 0
// same as above, but just barely able to run in real time on modern machines
void inverse_mdct_slow(float *buffer, int n, vorb *f, int blocktype)
{
float mcos[16384];
int i,j;
int n2 = n >> 1, nmask = (n << 2) -1;
float *x = (float *) malloc(sizeof(*x) * n2);
memcpy(x, buffer, sizeof(*x) * n2);
for (i=0; i < 4*n; ++i)
mcos[i] = (float) cos(M_PI / 2 * i / n);
for (i=0; i < n; ++i) {
float acc = 0;
for (j=0; j < n2; ++j)
acc += x[j] * mcos[(2 * i + 1 + n2)*(2*j+1) & nmask];
buffer[i] = acc;
}
free(x);
}
#elif 0
// transform to use a slow dct-iv; this is STILL basically trivial,
// but only requires half as many ops
void dct_iv_slow(float *buffer, int n)
{
float mcos[16384];
float x[2048];
int i,j;
int n2 = n >> 1, nmask = (n << 3) - 1;
memcpy(x, buffer, sizeof(*x) * n);
for (i=0; i < 8*n; ++i)
mcos[i] = (float) cos(M_PI / 4 * i / n);
for (i=0; i < n; ++i) {
float acc = 0;
for (j=0; j < n; ++j)
acc += x[j] * mcos[((2 * i + 1)*(2*j+1)) & nmask];
buffer[i] = acc;
}
}
void inverse_mdct_slow(float *buffer, int n, vorb *f, int blocktype)
{
int i, n4 = n >> 2, n2 = n >> 1, n3_4 = n - n4;
float temp[4096];
memcpy(temp, buffer, n2 * sizeof(float));
dct_iv_slow(temp, n2); // returns -c'-d, a-b'
for (i=0; i < n4 ; ++i) buffer[i] = temp[i+n4]; // a-b'
for ( ; i < n3_4; ++i) buffer[i] = -temp[n3_4 - i - 1]; // b-a', c+d'
for ( ; i < n ; ++i) buffer[i] = -temp[i - n3_4]; // c'+d
}
#endif
#ifndef LIBVORBIS_MDCT
#define LIBVORBIS_MDCT 0
#endif
#if LIBVORBIS_MDCT
// directly call the vorbis MDCT using an interface documented
// by Jeff Roberts... useful for performance comparison
typedef struct
{
int n;
int log2n;
float *trig;
int *bitrev;
float scale;
} mdct_lookup;
extern void mdct_init(mdct_lookup *lookup, int n);
extern void mdct_clear(mdct_lookup *l);
extern void mdct_backward(mdct_lookup *init, float *in, float *out);
mdct_lookup M1,M2;
void inverse_mdct(float *buffer, int n, vorb *f, int blocktype)
{
mdct_lookup *M;
if (M1.n == n) M = &M1;
else if (M2.n == n) M = &M2;
else if (M1.n == 0) { mdct_init(&M1, n); M = &M1; }
else {
if (M2.n) __asm int 3;
mdct_init(&M2, n);
M = &M2;
}
mdct_backward(M, buffer, buffer);
}
#endif
// the following were split out into separate functions while optimizing;
// they could be pushed back up but eh. __forceinline showed no change;
// they're probably already being inlined.
static void imdct_step3_iter0_loop(int n, float *e, int i_off, int k_off, float *A)
{
float *ee0 = e + i_off;
float *ee2 = ee0 + k_off;
int i;
assert((n & 3) == 0);
for (i=(n>>2); i > 0; --i) {
float k00_20, k01_21;
k00_20 = ee0[ 0] - ee2[ 0];
k01_21 = ee0[-1] - ee2[-1];
ee0[ 0] += ee2[ 0];//ee0[ 0] = ee0[ 0] + ee2[ 0];
ee0[-1] += ee2[-1];//ee0[-1] = ee0[-1] + ee2[-1];
ee2[ 0] = k00_20 * A[0] - k01_21 * A[1];
ee2[-1] = k01_21 * A[0] + k00_20 * A[1];
A += 8;
k00_20 = ee0[-2] - ee2[-2];
k01_21 = ee0[-3] - ee2[-3];
ee0[-2] += ee2[-2];//ee0[-2] = ee0[-2] + ee2[-2];
ee0[-3] += ee2[-3];//ee0[-3] = ee0[-3] + ee2[-3];
ee2[-2] = k00_20 * A[0] - k01_21 * A[1];
ee2[-3] = k01_21 * A[0] + k00_20 * A[1];
A += 8;
k00_20 = ee0[-4] - ee2[-4];
k01_21 = ee0[-5] - ee2[-5];
ee0[-4] += ee2[-4];//ee0[-4] = ee0[-4] + ee2[-4];
ee0[-5] += ee2[-5];//ee0[-5] = ee0[-5] + ee2[-5];
ee2[-4] = k00_20 * A[0] - k01_21 * A[1];
ee2[-5] = k01_21 * A[0] + k00_20 * A[1];
A += 8;
k00_20 = ee0[-6] - ee2[-6];
k01_21 = ee0[-7] - ee2[-7];
ee0[-6] += ee2[-6];//ee0[-6] = ee0[-6] + ee2[-6];
ee0[-7] += ee2[-7];//ee0[-7] = ee0[-7] + ee2[-7];
ee2[-6] = k00_20 * A[0] - k01_21 * A[1];
ee2[-7] = k01_21 * A[0] + k00_20 * A[1];
A += 8;
ee0 -= 8;
ee2 -= 8;
}
}
static void imdct_step3_inner_r_loop(int lim, float *e, int d0, int k_off, float *A, int k1)
{
int i;
float k00_20, k01_21;
float *e0 = e + d0;
float *e2 = e0 + k_off;
for (i=lim >> 2; i > 0; --i) {
k00_20 = e0[-0] - e2[-0];
k01_21 = e0[-1] - e2[-1];
e0[-0] += e2[-0];//e0[-0] = e0[-0] + e2[-0];
e0[-1] += e2[-1];//e0[-1] = e0[-1] + e2[-1];
e2[-0] = (k00_20)*A[0] - (k01_21) * A[1];
e2[-1] = (k01_21)*A[0] + (k00_20) * A[1];
A += k1;
k00_20 = e0[-2] - e2[-2];
k01_21 = e0[-3] - e2[-3];
e0[-2] += e2[-2];//e0[-2] = e0[-2] + e2[-2];
e0[-3] += e2[-3];//e0[-3] = e0[-3] + e2[-3];
e2[-2] = (k00_20)*A[0] - (k01_21) * A[1];
e2[-3] = (k01_21)*A[0] + (k00_20) * A[1];
A += k1;
k00_20 = e0[-4] - e2[-4];
k01_21 = e0[-5] - e2[-5];
e0[-4] += e2[-4];//e0[-4] = e0[-4] + e2[-4];
e0[-5] += e2[-5];//e0[-5] = e0[-5] + e2[-5];
e2[-4] = (k00_20)*A[0] - (k01_21) * A[1];
e2[-5] = (k01_21)*A[0] + (k00_20) * A[1];
A += k1;
k00_20 = e0[-6] - e2[-6];
k01_21 = e0[-7] - e2[-7];
e0[-6] += e2[-6];//e0[-6] = e0[-6] + e2[-6];
e0[-7] += e2[-7];//e0[-7] = e0[-7] + e2[-7];
e2[-6] = (k00_20)*A[0] - (k01_21) * A[1];
e2[-7] = (k01_21)*A[0] + (k00_20) * A[1];
e0 -= 8;
e2 -= 8;
A += k1;
}
}
static void imdct_step3_inner_s_loop(int n, float *e, int i_off, int k_off, float *A, int a_off, int k0)
{
int i;
float A0 = A[0];
float A1 = A[0+1];
float A2 = A[0+a_off];
float A3 = A[0+a_off+1];
float A4 = A[0+a_off*2+0];
float A5 = A[0+a_off*2+1];
float A6 = A[0+a_off*3+0];
float A7 = A[0+a_off*3+1];
float k00,k11;
float *ee0 = e +i_off;
float *ee2 = ee0+k_off;
for (i=n; i > 0; --i) {
k00 = ee0[ 0] - ee2[ 0];
k11 = ee0[-1] - ee2[-1];
ee0[ 0] = ee0[ 0] + ee2[ 0];
ee0[-1] = ee0[-1] + ee2[-1];
ee2[ 0] = (k00) * A0 - (k11) * A1;
ee2[-1] = (k11) * A0 + (k00) * A1;
k00 = ee0[-2] - ee2[-2];
k11 = ee0[-3] - ee2[-3];
ee0[-2] = ee0[-2] + ee2[-2];
ee0[-3] = ee0[-3] + ee2[-3];
ee2[-2] = (k00) * A2 - (k11) * A3;
ee2[-3] = (k11) * A2 + (k00) * A3;
k00 = ee0[-4] - ee2[-4];
k11 = ee0[-5] - ee2[-5];
ee0[-4] = ee0[-4] + ee2[-4];
ee0[-5] = ee0[-5] + ee2[-5];
ee2[-4] = (k00) * A4 - (k11) * A5;
ee2[-5] = (k11) * A4 + (k00) * A5;
k00 = ee0[-6] - ee2[-6];
k11 = ee0[-7] - ee2[-7];
ee0[-6] = ee0[-6] + ee2[-6];
ee0[-7] = ee0[-7] + ee2[-7];
ee2[-6] = (k00) * A6 - (k11) * A7;
ee2[-7] = (k11) * A6 + (k00) * A7;
ee0 -= k0;
ee2 -= k0;
}
}
static __forceinline void iter_54(float *z)
{
float k00,k11,k22,k33;
float y0,y1,y2,y3;
k00 = z[ 0] - z[-4];
y0 = z[ 0] + z[-4];
y2 = z[-2] + z[-6];
k22 = z[-2] - z[-6];
z[-0] = y0 + y2; // z0 + z4 + z2 + z6
z[-2] = y0 - y2; // z0 + z4 - z2 - z6
// done with y0,y2
k33 = z[-3] - z[-7];
z[-4] = k00 + k33; // z0 - z4 + z3 - z7
z[-6] = k00 - k33; // z0 - z4 - z3 + z7
// done with k33
k11 = z[-1] - z[-5];
y1 = z[-1] + z[-5];
y3 = z[-3] + z[-7];
z[-1] = y1 + y3; // z1 + z5 + z3 + z7
z[-3] = y1 - y3; // z1 + z5 - z3 - z7
z[-5] = k11 - k22; // z1 - z5 + z2 - z6
z[-7] = k11 + k22; // z1 - z5 - z2 + z6
}
static void imdct_step3_inner_s_loop_ld654(int n, float *e, int i_off, float *A, int base_n)
{
int a_off = base_n >> 3;
float A2 = A[0+a_off];
float *z = e + i_off;
float *base = z - 16 * n;
while (z > base) {
float k00,k11;
k00 = z[-0] - z[-8];
k11 = z[-1] - z[-9];
z[-0] = z[-0] + z[-8];
z[-1] = z[-1] + z[-9];
z[-8] = k00;
z[-9] = k11 ;
k00 = z[ -2] - z[-10];
k11 = z[ -3] - z[-11];
z[ -2] = z[ -2] + z[-10];
z[ -3] = z[ -3] + z[-11];
z[-10] = (k00+k11) * A2;
z[-11] = (k11-k00) * A2;
k00 = z[-12] - z[ -4]; // reverse to avoid a unary negation
k11 = z[ -5] - z[-13];
z[ -4] = z[ -4] + z[-12];
z[ -5] = z[ -5] + z[-13];
z[-12] = k11;
z[-13] = k00;
k00 = z[-14] - z[ -6]; // reverse to avoid a unary negation
k11 = z[ -7] - z[-15];
z[ -6] = z[ -6] + z[-14];
z[ -7] = z[ -7] + z[-15];
z[-14] = (k00+k11) * A2;
z[-15] = (k00-k11) * A2;
iter_54(z);
iter_54(z-8);
z -= 16;
}
}
static void inverse_mdct(float *buffer, int n, vorb *f, int blocktype)
{
int n2 = n >> 1, n4 = n >> 2, n8 = n >> 3, l;
int ld;
// @OPTIMIZE: reduce register pressure by using fewer variables?
int save_point = temp_alloc_save(f);
float *buf2 = (float *) temp_alloc(f, n2 * sizeof(*buf2));
float *u=NULL,*v=NULL;
// twiddle factors
float *A = f->A[blocktype];
// IMDCT algorithm from "The use of multirate filter banks for coding of high quality digital audio"
// See notes about bugs in that paper in less-optimal implementation 'inverse_mdct_old' after this function.
// kernel from paper
// merged:
// copy and reflect spectral data
// step 0
// note that it turns out that the items added together during
// this step are, in fact, being added to themselves (as reflected
// by step 0). inexplicable inefficiency! this became obvious
// once I combined the passes.
// so there's a missing 'times 2' here (for adding X to itself).
// this propagates through linearly to the end, where the numbers
// are 1/2 too small, and need to be compensated for.
{
float *d,*e, *AA, *e_stop;
d = &buf2[n2-2];
AA = A;
e = &buffer[0];
e_stop = &buffer[n2];
while (e != e_stop) {
d[1] = (e[0] * AA[0] - e[2]*AA[1]);
d[0] = (e[0] * AA[1] + e[2]*AA[0]);
d -= 2;
AA += 2;
e += 4;
}
e = &buffer[n2-3];
while (d >= buf2) {
d[1] = (-e[2] * AA[0] - -e[0]*AA[1]);
d[0] = (-e[2] * AA[1] + -e[0]*AA[0]);
d -= 2;
AA += 2;
e -= 4;
}
}
// now we use symbolic names for these, so that we can
// possibly swap their meaning as we change which operations
// are in place
u = buffer;
v = buf2;
// step 2 (paper output is w, now u)
// this could be in place, but the data ends up in the wrong
// place... _somebody_'s got to swap it, so this is nominated
{
float *AA = &A[n2-8];
float *d0,*d1, *e0, *e1;
e0 = &v[n4];
e1 = &v[0];
d0 = &u[n4];
d1 = &u[0];
while (AA >= A) {
float v40_20, v41_21;
v41_21 = e0[1] - e1[1];
v40_20 = e0[0] - e1[0];
d0[1] = e0[1] + e1[1];
d0[0] = e0[0] + e1[0];
d1[1] = v41_21*AA[4] - v40_20*AA[5];
d1[0] = v40_20*AA[4] + v41_21*AA[5];
v41_21 = e0[3] - e1[3];
v40_20 = e0[2] - e1[2];
d0[3] = e0[3] + e1[3];
d0[2] = e0[2] + e1[2];
d1[3] = v41_21*AA[0] - v40_20*AA[1];
d1[2] = v40_20*AA[0] + v41_21*AA[1];
AA -= 8;
d0 += 4;
d1 += 4;
e0 += 4;
e1 += 4;
}
}
// step 3
ld = ilog(n) - 1; // ilog is off-by-one from normal definitions
// optimized step 3:
// the original step3 loop can be nested r inside s or s inside r;
// it's written originally as s inside r, but this is dumb when r
// iterates many times, and s few. So I have two copies of it and
// switch between them halfway.
// this is iteration 0 of step 3
imdct_step3_iter0_loop(n >> 4, u, n2-1-n4*0, -(n >> 3), A);
imdct_step3_iter0_loop(n >> 4, u, n2-1-n4*1, -(n >> 3), A);
// this is iteration 1 of step 3
imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*0, -(n >> 4), A, 16);
imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*1, -(n >> 4), A, 16);
imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*2, -(n >> 4), A, 16);
imdct_step3_inner_r_loop(n >> 5, u, n2-1 - n8*3, -(n >> 4), A, 16);
l=2;
for (; l < (ld-3)>>1; ++l) {
int k0 = n >> (l+2), k0_2 = k0>>1;
int lim = 1 << (l+1);
int i;
for (i=0; i < lim; ++i)
imdct_step3_inner_r_loop(n >> (l+4), u, n2-1 - k0*i, -k0_2, A, 1 << (l+3));
}
for (; l < ld-6; ++l) {
int k0 = n >> (l+2), k1 = 1 << (l+3), k0_2 = k0>>1;
int rlim = n >> (l+6), r;
int lim = 1 << (l+1);
int i_off;
float *A0 = A;
i_off = n2-1;
for (r=rlim; r > 0; --r) {
imdct_step3_inner_s_loop(lim, u, i_off, -k0_2, A0, k1, k0);
A0 += k1*4;
i_off -= 8;
}
}
// iterations with count:
// ld-6,-5,-4 all interleaved together
// the big win comes from getting rid of needless flops
// due to the constants on pass 5 & 4 being all 1 and 0;
// combining them to be simultaneous to improve cache made little difference
imdct_step3_inner_s_loop_ld654(n >> 5, u, n2-1, A, n);
// output is u
// step 4, 5, and 6
// cannot be in-place because of step 5
{
uint16 *bitrev = f->bit_reverse[blocktype];
// weirdly, I'd have thought reading sequentially and writing
// erratically would have been better than vice-versa, but in
// fact that's not what my testing showed. (That is, with
// j = bitreverse(i), do you read i and write j, or read j and write i.)
float *d0 = &v[n4-4];
float *d1 = &v[n2-4];
while (d0 >= v) {
int k4;
k4 = bitrev[0];
d1[3] = u[k4+0];
d1[2] = u[k4+1];
d0[3] = u[k4+2];
d0[2] = u[k4+3];
k4 = bitrev[1];
d1[1] = u[k4+0];
d1[0] = u[k4+1];
d0[1] = u[k4+2];
d0[0] = u[k4+3];
d0 -= 4;
d1 -= 4;
bitrev += 2;
}
}
// (paper output is u, now v)
// data must be in buf2
assert(v == buf2);
// step 7 (paper output is v, now v)
// this is now in place
{
float *C = f->C[blocktype];
float *d, *e;
d = v;
e = v + n2 - 4;
while (d < e) {
float a02,a11,b0,b1,b2,b3;
a02 = d[0] - e[2];
a11 = d[1] + e[3];
b0 = C[1]*a02 + C[0]*a11;
b1 = C[1]*a11 - C[0]*a02;
b2 = d[0] + e[ 2];
b3 = d[1] - e[ 3];
d[0] = b2 + b0;
d[1] = b3 + b1;
e[2] = b2 - b0;
e[3] = b1 - b3;
a02 = d[2] - e[0];
a11 = d[3] + e[1];
b0 = C[3]*a02 + C[2]*a11;
b1 = C[3]*a11 - C[2]*a02;
b2 = d[2] + e[ 0];
b3 = d[3] - e[ 1];
d[2] = b2 + b0;
d[3] = b3 + b1;
e[0] = b2 - b0;
e[1] = b1 - b3;
C += 4;
d += 4;
e -= 4;
}
}
// data must be in buf2
// step 8+decode (paper output is X, now buffer)
// this generates pairs of data a la 8 and pushes them directly through
// the decode kernel (pushing rather than pulling) to avoid having
// to make another pass later
// this cannot POSSIBLY be in place, so we refer to the buffers directly
{
float *d0,*d1,*d2,*d3;
float *B = f->B[blocktype] + n2 - 8;
float *e = buf2 + n2 - 8;
d0 = &buffer[0];
d1 = &buffer[n2-4];
d2 = &buffer[n2];
d3 = &buffer[n-4];
while (e >= v) {
float p0,p1,p2,p3;
p3 = e[6]*B[7] - e[7]*B[6];
p2 = -e[6]*B[6] - e[7]*B[7];
d0[0] = p3;
d1[3] = - p3;
d2[0] = p2;
d3[3] = p2;
p1 = e[4]*B[5] - e[5]*B[4];
p0 = -e[4]*B[4] - e[5]*B[5];
d0[1] = p1;
d1[2] = - p1;
d2[1] = p0;
d3[2] = p0;
p3 = e[2]*B[3] - e[3]*B[2];
p2 = -e[2]*B[2] - e[3]*B[3];
d0[2] = p3;
d1[1] = - p3;
d2[2] = p2;
d3[1] = p2;
p1 = e[0]*B[1] - e[1]*B[0];
p0 = -e[0]*B[0] - e[1]*B[1];
d0[3] = p1;
d1[0] = - p1;
d2[3] = p0;
d3[0] = p0;
B -= 8;
e -= 8;
d0 += 4;
d2 += 4;
d1 -= 4;
d3 -= 4;
}
}
temp_free(f,buf2);
temp_alloc_restore(f,save_point);
}
#if 0
// this is the original version of the above code, if you want to optimize it from scratch
void inverse_mdct_naive(float *buffer, int n)
{
float s;
float A[1 << 12], B[1 << 12], C[1 << 11];
int i,k,k2,k4, n2 = n >> 1, n4 = n >> 2, n8 = n >> 3, l;
int n3_4 = n - n4, ld;
// how can they claim this only uses N words?!
// oh, because they're only used sparsely, whoops
float u[1 << 13], X[1 << 13], v[1 << 13], w[1 << 13];
// set up twiddle factors
for (k=k2=0; k < n4; ++k,k2+=2) {
A[k2 ] = (float) cos(4*k*M_PI/n);
A[k2+1] = (float) -sin(4*k*M_PI/n);
B[k2 ] = (float) cos((k2+1)*M_PI/n/2);
B[k2+1] = (float) sin((k2+1)*M_PI/n/2);
}
for (k=k2=0; k < n8; ++k,k2+=2) {
C[k2 ] = (float) cos(2*(k2+1)*M_PI/n);
C[k2+1] = (float) -sin(2*(k2+1)*M_PI/n);
}
// IMDCT algorithm from "The use of multirate filter banks for coding of high quality digital audio"
// Note there are bugs in that pseudocode, presumably due to them attempting
// to rename the arrays nicely rather than representing the way their actual
// implementation bounces buffers back and forth. As a result, even in the
// "some formulars corrected" version, a direct implementation fails. These
// are noted below as "paper bug".
// copy and reflect spectral data
for (k=0; k < n2; ++k) u[k] = buffer[k];
for ( ; k < n ; ++k) u[k] = -buffer[n - k - 1];
// kernel from paper
// step 1
for (k=k2=k4=0; k < n4; k+=1, k2+=2, k4+=4) {
v[n-k4-1] = (u[k4] - u[n-k4-1]) * A[k2] - (u[k4+2] - u[n-k4-3])*A[k2+1];
v[n-k4-3] = (u[k4] - u[n-k4-1]) * A[k2+1] + (u[k4+2] - u[n-k4-3])*A[k2];
}
// step 2
for (k=k4=0; k < n8; k+=1, k4+=4) {
w[n2+3+k4] = v[n2+3+k4] + v[k4+3];
w[n2+1+k4] = v[n2+1+k4] + v[k4+1];
w[k4+3] = (v[n2+3+k4] - v[k4+3])*A[n2-4-k4] - (v[n2+1+k4]-v[k4+1])*A[n2-3-k4];
w[k4+1] = (v[n2+1+k4] - v[k4+1])*A[n2-4-k4] + (v[n2+3+k4]-v[k4+3])*A[n2-3-k4];
}
// step 3
ld = ilog(n) - 1; // ilog is off-by-one from normal definitions
for (l=0; l < ld-3; ++l) {
int k0 = n >> (l+2), k1 = 1 << (l+3);
int rlim = n >> (l+4), r4, r;
int s2lim = 1 << (l+2), s2;
for (r=r4=0; r < rlim; r4+=4,++r) {
for (s2=0; s2 < s2lim; s2+=2) {
u[n-1-k0*s2-r4] = w[n-1-k0*s2-r4] + w[n-1-k0*(s2+1)-r4];
u[n-3-k0*s2-r4] = w[n-3-k0*s2-r4] + w[n-3-k0*(s2+1)-r4];
u[n-1-k0*(s2+1)-r4] = (w[n-1-k0*s2-r4] - w[n-1-k0*(s2+1)-r4]) * A[r*k1]
- (w[n-3-k0*s2-r4] - w[n-3-k0*(s2+1)-r4]) * A[r*k1+1];
u[n-3-k0*(s2+1)-r4] = (w[n-3-k0*s2-r4] - w[n-3-k0*(s2+1)-r4]) * A[r*k1]
+ (w[n-1-k0*s2-r4] - w[n-1-k0*(s2+1)-r4]) * A[r*k1+1];
}
}
if (l+1 < ld-3) {
// paper bug: ping-ponging of u&w here is omitted
memcpy(w, u, sizeof(u));
}
}
// step 4
for (i=0; i < n8; ++i) {
int j = bit_reverse(i) >> (32-ld+3);
assert(j < n8);
if (i == j) {
// paper bug: original code probably swapped in place; if copying,
// need to directly copy in this case
int i8 = i << 3;
v[i8+1] = u[i8+1];
v[i8+3] = u[i8+3];
v[i8+5] = u[i8+5];
v[i8+7] = u[i8+7];
} else if (i < j) {
int i8 = i << 3, j8 = j << 3;
v[j8+1] = u[i8+1], v[i8+1] = u[j8 + 1];
v[j8+3] = u[i8+3], v[i8+3] = u[j8 + 3];
v[j8+5] = u[i8+5], v[i8+5] = u[j8 + 5];
v[j8+7] = u[i8+7], v[i8+7] = u[j8 + 7];
}
}
// step 5
for (k=0; k < n2; ++k) {
w[k] = v[k*2+1];
}
// step 6
for (k=k2=k4=0; k < n8; ++k, k2 += 2, k4 += 4) {
u[n-1-k2] = w[k4];
u[n-2-k2] = w[k4+1];
u[n3_4 - 1 - k2] = w[k4+2];
u[n3_4 - 2 - k2] = w[k4+3];
}
// step 7
for (k=k2=0; k < n8; ++k, k2 += 2) {
v[n2 + k2 ] = ( u[n2 + k2] + u[n-2-k2] + C[k2+1]*(u[n2+k2]-u[n-2-k2]) + C[k2]*(u[n2+k2+1]+u[n-2-k2+1]))/2;
v[n-2 - k2] = ( u[n2 + k2] + u[n-2-k2] - C[k2+1]*(u[n2+k2]-u[n-2-k2]) - C[k2]*(u[n2+k2+1]+u[n-2-k2+1]))/2;
v[n2+1+ k2] = ( u[n2+1+k2] - u[n-1-k2] + C[k2+1]*(u[n2+1+k2]+u[n-1-k2]) - C[k2]*(u[n2+k2]-u[n-2-k2]))/2;
v[n-1 - k2] = (-u[n2+1+k2] + u[n-1-k2] + C[k2+1]*(u[n2+1+k2]+u[n-1-k2]) - C[k2]*(u[n2+k2]-u[n-2-k2]))/2;
}
// step 8
for (k=k2=0; k < n4; ++k,k2 += 2) {
X[k] = v[k2+n2]*B[k2 ] + v[k2+1+n2]*B[k2+1];
X[n2-1-k] = v[k2+n2]*B[k2+1] - v[k2+1+n2]*B[k2 ];
}
// decode kernel to output
// determined the following value experimentally
// (by first figuring out what made inverse_mdct_slow work); then matching that here
// (probably vorbis encoder premultiplies by n or n/2, to save it on the decoder?)
s = 0.5; // theoretically would be n4
// [[[ note! the s value of 0.5 is compensated for by the B[] in the current code,
// so it needs to use the "old" B values to behave correctly, or else
// set s to 1.0 ]]]
for (i=0; i < n4 ; ++i) buffer[i] = s * X[i+n4];
for ( ; i < n3_4; ++i) buffer[i] = -s * X[n3_4 - i - 1];
for ( ; i < n ; ++i) buffer[i] = -s * X[i - n3_4];
}
#endif
static float *get_window(vorb *f, int len)
{
len <<= 1;
if (len == f->blocksize_0) return f->window[0];
if (len == f->blocksize_1) return f->window[1];
return NULL;
}
#ifndef STB_VORBIS_NO_DEFER_FLOOR
typedef int16 YTYPE;
#else
typedef int YTYPE;
#endif
static int do_floor(vorb *f, Mapping *map, int i, int n, float *target, YTYPE *finalY, uint8 *step2_flag)
{
int n2 = n >> 1;
int s = map->chan[i].mux, floor;
floor = map->submap_floor[s];
if (f->floor_types[floor] == 0) {
return error(f, VORBIS_invalid_stream);
} else {
Floor1 *g = &f->floor_config[floor].floor1;
int j,q;
int lx = 0, ly = finalY[0] * g->floor1_multiplier;
for (q=1; q < g->values; ++q) {
j = g->sorted_order[q];
#ifndef STB_VORBIS_NO_DEFER_FLOOR
if (finalY[j] >= 0)
#else
if (step2_flag[j])
#endif
{
int hy = finalY[j] * g->floor1_multiplier;
int hx = g->Xlist[j];
if (lx != hx)
draw_line(target, lx,ly, hx,hy, n2);
CHECK(f);
lx = hx, ly = hy;
}
}
if (lx < n2) {
// optimization of: draw_line(target, lx,ly, n,ly, n2);
for (j=lx; j < n2; ++j)
LINE_OP(target[j], inverse_db_table[ly]);
CHECK(f);
}
}
return TRUE;
}
// The meaning of "left" and "right"
//
// For a given frame:
// we compute samples from 0..n
// window_center is n/2
// we'll window and mix the samples from left_start to left_end with data from the previous frame
// all of the samples from left_end to right_start can be output without mixing; however,
// this interval is 0-length except when transitioning between short and long frames
// all of the samples from right_start to right_end need to be mixed with the next frame,
// which we don't have, so those get saved in a buffer
// frame N's right_end-right_start, the number of samples to mix with the next frame,
// has to be the same as frame N+1's left_end-left_start (which they are by
// construction)
static int vorbis_decode_initial(vorb *f, int *p_left_start, int *p_left_end, int *p_right_start, int *p_right_end, int *mode)
{
Mode *m;
int i, n, prev, next, window_center;
f->channel_buffer_start = f->channel_buffer_end = 0;
retry:
if (f->eof) return FALSE;
if (!maybe_start_packet(f))
return FALSE;
// check packet type
if (get_bits(f,1) != 0) {
if (IS_PUSH_MODE(f))
return error(f,VORBIS_bad_packet_type);
while (EOP != get8_packet(f));
goto retry;
}
if (f->alloc.alloc_buffer)
assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset);
i = get_bits(f, ilog(f->mode_count-1));
if (i == EOP) return FALSE;
if (i >= f->mode_count) return FALSE;
*mode = i;
m = f->mode_config + i;
if (m->blockflag) {
n = f->blocksize_1;
prev = get_bits(f,1);
next = get_bits(f,1);
} else {
prev = next = 0;
n = f->blocksize_0;
}
// WINDOWING
window_center = n >> 1;
if (m->blockflag && !prev) {
*p_left_start = (n - f->blocksize_0) >> 2;
*p_left_end = (n + f->blocksize_0) >> 2;
} else {
*p_left_start = 0;
*p_left_end = window_center;
}
if (m->blockflag && !next) {
*p_right_start = (n*3 - f->blocksize_0) >> 2;
*p_right_end = (n*3 + f->blocksize_0) >> 2;
} else {
*p_right_start = window_center;
*p_right_end = n;
}
return TRUE;
}
static int vorbis_decode_packet_rest(vorb *f, int *len, Mode *m, int left_start, int left_end, int right_start, int right_end, int *p_left)
{
Mapping *map;
int i,j,k,n,n2;
int zero_channel[256];
int really_zero_channel[256];
// WINDOWING
n = f->blocksize[m->blockflag];
map = &f->mapping[m->mapping];
// FLOORS
n2 = n >> 1;
CHECK(f);
for (i=0; i < f->channels; ++i) {
int s = map->chan[i].mux, floor;
zero_channel[i] = FALSE;
floor = map->submap_floor[s];
if (f->floor_types[floor] == 0) {
return error(f, VORBIS_invalid_stream);
} else {
Floor1 *g = &f->floor_config[floor].floor1;
if (get_bits(f, 1)) {
short *finalY;
uint8 step2_flag[256];
static int range_list[4] = { 256, 128, 86, 64 };
int range = range_list[g->floor1_multiplier-1];
int offset = 2;
finalY = f->finalY[i];
finalY[0] = get_bits(f, ilog(range)-1);
finalY[1] = get_bits(f, ilog(range)-1);
for (j=0; j < g->partitions; ++j) {
int pclass = g->partition_class_list[j];
int cdim = g->class_dimensions[pclass];
int cbits = g->class_subclasses[pclass];
int csub = (1 << cbits)-1;
int cval = 0;
if (cbits) {
Codebook *c = f->codebooks + g->class_masterbooks[pclass];
DECODE(cval,f,c);
}
for (k=0; k < cdim; ++k) {
int book = g->subclass_books[pclass][cval & csub];
cval = cval >> cbits;
if (book >= 0) {
int temp;
Codebook *c = f->codebooks + book;
DECODE(temp,f,c);
finalY[offset++] = temp;
} else
finalY[offset++] = 0;
}
}
if (f->valid_bits == INVALID_BITS) goto error; // behavior according to spec
step2_flag[0] = step2_flag[1] = 1;
for (j=2; j < g->values; ++j) {
int low, high, pred, highroom, lowroom, room, val;
low = g->neighbors[j][0];
high = g->neighbors[j][1];
//neighbors(g->Xlist, j, &low, &high);
pred = predict_point(g->Xlist[j], g->Xlist[low], g->Xlist[high], finalY[low], finalY[high]);
val = finalY[j];
highroom = range - pred;
lowroom = pred;
if (highroom < lowroom)
room = highroom * 2;
else
room = lowroom * 2;
if (val) {
step2_flag[low] = step2_flag[high] = 1;
step2_flag[j] = 1;
if (val >= room)
if (highroom > lowroom)
finalY[j] = val - lowroom + pred;
else
finalY[j] = pred - val + highroom - 1;
else
if (val & 1)
finalY[j] = pred - ((val+1)>>1);
else
finalY[j] = pred + (val>>1);
} else {
step2_flag[j] = 0;
finalY[j] = pred;
}
}
#ifdef STB_VORBIS_NO_DEFER_FLOOR
do_floor(f, map, i, n, f->floor_buffers[i], finalY, step2_flag);
#else
// defer final floor computation until _after_ residue
for (j=0; j < g->values; ++j) {
if (!step2_flag[j])
finalY[j] = -1;
}
#endif
} else {
error:
zero_channel[i] = TRUE;
}
// So we just defer everything else to later
// at this point we've decoded the floor into buffer
}
}
CHECK(f);
// at this point we've decoded all floors
if (f->alloc.alloc_buffer)
assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset);
// re-enable coupled channels if necessary
memcpy(really_zero_channel, zero_channel, sizeof(really_zero_channel[0]) * f->channels);
for (i=0; i < map->coupling_steps; ++i)
if (!zero_channel[map->chan[i].magnitude] || !zero_channel[map->chan[i].angle]) {
zero_channel[map->chan[i].magnitude] = zero_channel[map->chan[i].angle] = FALSE;
}
CHECK(f);
// RESIDUE DECODE
for (i=0; i < map->submaps; ++i) {
float *residue_buffers[STB_VORBIS_MAX_CHANNELS];
int r;
uint8 do_not_decode[256];
int ch = 0;
for (j=0; j < f->channels; ++j) {
if (map->chan[j].mux == i) {
if (zero_channel[j]) {
do_not_decode[ch] = TRUE;
residue_buffers[ch] = NULL;
} else {
do_not_decode[ch] = FALSE;
residue_buffers[ch] = f->channel_buffers[j];
}
++ch;
}
}
r = map->submap_residue[i];
decode_residue(f, residue_buffers, ch, n2, r, do_not_decode);
}
if (f->alloc.alloc_buffer)
assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset);
CHECK(f);
// INVERSE COUPLING
for (i = map->coupling_steps-1; i >= 0; --i) {
int n2 = n >> 1;
float *m = f->channel_buffers[map->chan[i].magnitude];
float *a = f->channel_buffers[map->chan[i].angle ];
for (j=0; j < n2; ++j) {
float a2,m2;
if (m[j] > 0)
if (a[j] > 0)
m2 = m[j], a2 = m[j] - a[j];
else
a2 = m[j], m2 = m[j] + a[j];
else
if (a[j] > 0)
m2 = m[j], a2 = m[j] + a[j];
else
a2 = m[j], m2 = m[j] - a[j];
m[j] = m2;
a[j] = a2;
}
}
CHECK(f);
// finish decoding the floors
#ifndef STB_VORBIS_NO_DEFER_FLOOR
for (i=0; i < f->channels; ++i) {
if (really_zero_channel[i]) {
memset(f->channel_buffers[i], 0, sizeof(*f->channel_buffers[i]) * n2);
} else {
do_floor(f, map, i, n, f->channel_buffers[i], f->finalY[i], NULL);
}
}
#else
for (i=0; i < f->channels; ++i) {
if (really_zero_channel[i]) {
memset(f->channel_buffers[i], 0, sizeof(*f->channel_buffers[i]) * n2);
} else {
for (j=0; j < n2; ++j)
f->channel_buffers[i][j] *= f->floor_buffers[i][j];
}
}
#endif
// INVERSE MDCT
CHECK(f);
for (i=0; i < f->channels; ++i)
inverse_mdct(f->channel_buffers[i], n, f, m->blockflag);
CHECK(f);
// this shouldn't be necessary, unless we exited on an error
// and want to flush to get to the next packet
flush_packet(f);
if (f->first_decode) {
// assume we start so first non-discarded sample is sample 0
// this isn't to spec, but spec would require us to read ahead
// and decode the size of all current frames--could be done,
// but presumably it's not a commonly used feature
f->current_loc = -n2; // start of first frame is positioned for discard
// we might have to discard samples "from" the next frame too,
// if we're lapping a large block then a small at the start?
f->discard_samples_deferred = n - right_end;
f->current_loc_valid = TRUE;
f->first_decode = FALSE;
} else if (f->discard_samples_deferred) {
if (f->discard_samples_deferred >= right_start - left_start) {
f->discard_samples_deferred -= (right_start - left_start);
left_start = right_start;
*p_left = left_start;
} else {
left_start += f->discard_samples_deferred;
*p_left = left_start;
f->discard_samples_deferred = 0;
}
} else if (f->previous_length == 0 && f->current_loc_valid) {
// we're recovering from a seek... that means we're going to discard
// the samples from this packet even though we know our position from
// the last page header, so we need to update the position based on
// the discarded samples here
// but wait, the code below is going to add this in itself even
// on a discard, so we don't need to do it here...
}
// check if we have ogg information about the sample # for this packet
if (f->last_seg_which == f->end_seg_with_known_loc) {
// if we have a valid current loc, and this is final:
if (f->current_loc_valid && (f->page_flag & PAGEFLAG_last_page)) {
uint32 current_end = f->known_loc_for_packet;
// then let's infer the size of the (probably) short final frame
if (current_end < f->current_loc + (right_end-left_start)) {
if (current_end < f->current_loc) {
// negative truncation, that's impossible!
*len = 0;
} else {
*len = current_end - f->current_loc;
}
*len += left_start; // this doesn't seem right, but has no ill effect on my test files
if (*len > right_end) *len = right_end; // this should never happen
f->current_loc += *len;
return TRUE;
}
}
// otherwise, just set our sample loc
// guess that the ogg granule pos refers to the _middle_ of the
// last frame?
// set f->current_loc to the position of left_start
f->current_loc = f->known_loc_for_packet - (n2-left_start);
f->current_loc_valid = TRUE;
}
if (f->current_loc_valid)
f->current_loc += (right_start - left_start);
if (f->alloc.alloc_buffer)
assert(f->alloc.alloc_buffer_length_in_bytes == f->temp_offset);
*len = right_end; // ignore samples after the window goes to 0
CHECK(f);
return TRUE;
}
static int vorbis_decode_packet(vorb *f, int *len, int *p_left, int *p_right)
{
int mode, left_end, right_end;
if (!vorbis_decode_initial(f, p_left, &left_end, p_right, &right_end, &mode)) return 0;
return vorbis_decode_packet_rest(f, len, f->mode_config + mode, *p_left, left_end, *p_right, right_end, p_left);
}
static int vorbis_finish_frame(stb_vorbis *f, int len, int left, int right)
{
int prev,i,j;
// we use right&left (the start of the right- and left-window sin()-regions)
// to determine how much to return, rather than inferring from the rules
// (same result, clearer code); 'left' indicates where our sin() window
// starts, therefore where the previous window's right edge starts, and
// therefore where to start mixing from the previous buffer. 'right'
// indicates where our sin() ending-window starts, therefore that's where
// we start saving, and where our returned-data ends.
// mixin from previous window
if (f->previous_length) {
int i,j, n = f->previous_length;
float *w = get_window(f, n);
if (w == NULL) return 0;
for (i=0; i < f->channels; ++i) {
for (j=0; j < n; ++j)
f->channel_buffers[i][left+j] =
f->channel_buffers[i][left+j]*w[ j] +
f->previous_window[i][ j]*w[n-1-j];
}
}
prev = f->previous_length;
// last half of this data becomes previous window
f->previous_length = len - right;
// @OPTIMIZE: could avoid this copy by double-buffering the
// output (flipping previous_window with channel_buffers), but
// then previous_window would have to be 2x as large, and
// channel_buffers couldn't be temp mem (although they're NOT
// currently temp mem, they could be (unless we want to level
// performance by spreading out the computation))
for (i=0; i < f->channels; ++i)
for (j=0; right+j < len; ++j)
f->previous_window[i][j] = f->channel_buffers[i][right+j];
if (!prev)
// there was no previous packet, so this data isn't valid...
// this isn't entirely true, only the would-have-overlapped data
// isn't valid, but this seems to be what the spec requires
return 0;
// truncate a short frame
if (len < right) right = len;
f->samples_output += right-left;
return right - left;
}
static int vorbis_pump_first_frame(stb_vorbis *f)
{
int len, right, left, res;
res = vorbis_decode_packet(f, &len, &left, &right);
if (res)
vorbis_finish_frame(f, len, left, right);
return res;
}
#ifndef STB_VORBIS_NO_PUSHDATA_API
static int is_whole_packet_present(stb_vorbis *f)
{
// make sure that we have the packet available before continuing...
// this requires a full ogg parse, but we know we can fetch from f->stream
// instead of coding this out explicitly, we could save the current read state,
// read the next packet with get8() until end-of-packet, check f->eof, then
// reset the state? but that would be slower, esp. since we'd have over 256 bytes
// of state to restore (primarily the page segment table)
int s = f->next_seg, first = TRUE;
uint8 *p = f->stream;
if (s != -1) { // if we're not starting the packet with a 'continue on next page' flag
for (; s < f->segment_count; ++s) {
p += f->segments[s];
if (f->segments[s] < 255) // stop at first short segment
break;
}
// either this continues, or it ends it...
if (s == f->segment_count)
s = -1; // set 'crosses page' flag
if (p > f->stream_end) return error(f, VORBIS_need_more_data);
first = FALSE;
}
for (; s == -1;) {
uint8 *q;
int n;
// check that we have the page header ready
if (p + 26 >= f->stream_end) return error(f, VORBIS_need_more_data);
// validate the page
if (memcmp(p, ogg_page_header, 4)) return error(f, VORBIS_invalid_stream);
if (p[4] != 0) return error(f, VORBIS_invalid_stream);
if (first) { // the first segment must NOT have 'continued_packet', later ones MUST
if (f->previous_length)
if ((p[5] & PAGEFLAG_continued_packet)) return error(f, VORBIS_invalid_stream);
// if no previous length, we're resynching, so we can come in on a continued-packet,
// which we'll just drop
} else {
if (!(p[5] & PAGEFLAG_continued_packet)) return error(f, VORBIS_invalid_stream);
}
n = p[26]; // segment counts
q = p+27; // q points to segment table
p = q + n; // advance past header
// make sure we've read the segment table
if (p > f->stream_end) return error(f, VORBIS_need_more_data);
for (s=0; s < n; ++s) {
p += q[s];
if (q[s] < 255)
break;
}
if (s == n)
s = -1; // set 'crosses page' flag
if (p > f->stream_end) return error(f, VORBIS_need_more_data);
first = FALSE;
}
return TRUE;
}
#endif // !STB_VORBIS_NO_PUSHDATA_API
static int start_decoder(vorb *f)
{
uint8 header[6], x,y;
int len,i,j,k, max_submaps = 0;
int longest_floorlist=0;
// first page, first packet
f->first_decode = TRUE;
if (!start_page(f)) return FALSE;
// validate page flag
if (!(f->page_flag & PAGEFLAG_first_page)) return error(f, VORBIS_invalid_first_page);
if (f->page_flag & PAGEFLAG_last_page) return error(f, VORBIS_invalid_first_page);
if (f->page_flag & PAGEFLAG_continued_packet) return error(f, VORBIS_invalid_first_page);
// check for expected packet length
if (f->segment_count != 1) return error(f, VORBIS_invalid_first_page);
if (f->segments[0] != 30) {
// check for the Ogg skeleton fishead identifying header to refine our error
if (f->segments[0] == 64 &&
getn(f, header, 6) &&
header[0] == 'f' &&
header[1] == 'i' &&
header[2] == 's' &&
header[3] == 'h' &&
header[4] == 'e' &&
header[5] == 'a' &&
get8(f) == 'd' &&
get8(f) == '\0') return error(f, VORBIS_ogg_skeleton_not_supported);
else
return error(f, VORBIS_invalid_first_page);
}
// read packet
// check packet header
if (get8(f) != VORBIS_packet_id) return error(f, VORBIS_invalid_first_page);
if (!getn(f, header, 6)) return error(f, VORBIS_unexpected_eof);
if (!vorbis_validate(header)) return error(f, VORBIS_invalid_first_page);
// vorbis_version
if (get32(f) != 0) return error(f, VORBIS_invalid_first_page);
f->channels = get8(f); if (!f->channels) return error(f, VORBIS_invalid_first_page);
if (f->channels > STB_VORBIS_MAX_CHANNELS) return error(f, VORBIS_too_many_channels);
f->sample_rate = get32(f); if (!f->sample_rate) return error(f, VORBIS_invalid_first_page);
get32(f); // bitrate_maximum
get32(f); // bitrate_nominal
get32(f); // bitrate_minimum
x = get8(f);
{
int log0,log1;
log0 = x & 15;
log1 = x >> 4;
f->blocksize_0 = 1 << log0;
f->blocksize_1 = 1 << log1;
if (log0 < 6 || log0 > 13) return error(f, VORBIS_invalid_setup);
if (log1 < 6 || log1 > 13) return error(f, VORBIS_invalid_setup);
if (log0 > log1) return error(f, VORBIS_invalid_setup);
}
// framing_flag
x = get8(f);
if (!(x & 1)) return error(f, VORBIS_invalid_first_page);
// second packet!
if (!start_page(f)) return FALSE;
if (!start_packet(f)) return FALSE;
if (!next_segment(f)) return FALSE;
if (get8_packet(f) != VORBIS_packet_comment) return error(f, VORBIS_invalid_setup);
for (i=0; i < 6; ++i) header[i] = get8_packet(f);
if (!vorbis_validate(header)) return error(f, VORBIS_invalid_setup);
//file vendor
len = get32_packet(f);
f->vendor = (char*)setup_malloc(f, sizeof(char) * (len+1));
if (f->vendor == NULL) return error(f, VORBIS_outofmem);
for(i=0; i < len; ++i) {
f->vendor[i] = get8_packet(f);
}
f->vendor[len] = (char)'\0';
//user comments
f->comment_list_length = get32_packet(f);
f->comment_list = NULL;
if (f->comment_list_length > 0)
{
f->comment_list = (char**) setup_malloc(f, sizeof(char*) * (f->comment_list_length));
if (f->comment_list == NULL) return error(f, VORBIS_outofmem);
}
for(i=0; i < f->comment_list_length; ++i) {
len = get32_packet(f);
f->comment_list[i] = (char*)setup_malloc(f, sizeof(char) * (len+1));
if (f->comment_list[i] == NULL) return error(f, VORBIS_outofmem);
for(j=0; j < len; ++j) {
f->comment_list[i][j] = get8_packet(f);
}
f->comment_list[i][len] = (char)'\0';
}
// framing_flag
x = get8_packet(f);
if (!(x & 1)) return error(f, VORBIS_invalid_setup);
skip(f, f->bytes_in_seg);
f->bytes_in_seg = 0;
do {
len = next_segment(f);
skip(f, len);
f->bytes_in_seg = 0;
} while (len);
// third packet!
if (!start_packet(f)) return FALSE;
#ifndef STB_VORBIS_NO_PUSHDATA_API
if (IS_PUSH_MODE(f)) {
if (!is_whole_packet_present(f)) {
// convert error in ogg header to write type
if (f->error == VORBIS_invalid_stream)
f->error = VORBIS_invalid_setup;
return FALSE;
}
}
#endif
crc32_init(); // always init it, to avoid multithread race conditions
if (get8_packet(f) != VORBIS_packet_setup) return error(f, VORBIS_invalid_setup);
for (i=0; i < 6; ++i) header[i] = get8_packet(f);
if (!vorbis_validate(header)) return error(f, VORBIS_invalid_setup);
// codebooks
f->codebook_count = get_bits(f,8) + 1;
f->codebooks = (Codebook *) setup_malloc(f, sizeof(*f->codebooks) * f->codebook_count);
if (f->codebooks == NULL) return error(f, VORBIS_outofmem);
memset(f->codebooks, 0, sizeof(*f->codebooks) * f->codebook_count);
for (i=0; i < f->codebook_count; ++i) {
uint32 *values;
int ordered, sorted_count;
int total=0;
uint8 *lengths;
Codebook *c = f->codebooks+i;
CHECK(f);
x = get_bits(f, 8); if (x != 0x42) return error(f, VORBIS_invalid_setup);
x = get_bits(f, 8); if (x != 0x43) return error(f, VORBIS_invalid_setup);
x = get_bits(f, 8); if (x != 0x56) return error(f, VORBIS_invalid_setup);
x = get_bits(f, 8);
c->dimensions = (get_bits(f, 8)<<8) + x;
x = get_bits(f, 8);
y = get_bits(f, 8);
c->entries = (get_bits(f, 8)<<16) + (y<<8) + x;
ordered = get_bits(f,1);
c->sparse = ordered ? 0 : get_bits(f,1);
if (c->dimensions == 0 && c->entries != 0) return error(f, VORBIS_invalid_setup);
if (c->sparse)
lengths = (uint8 *) setup_temp_malloc(f, c->entries);
else
lengths = c->codeword_lengths = (uint8 *) setup_malloc(f, c->entries);
if (!lengths) return error(f, VORBIS_outofmem);
if (ordered) {
int current_entry = 0;
int current_length = get_bits(f,5) + 1;
while (current_entry < c->entries) {
int limit = c->entries - current_entry;
int n = get_bits(f, ilog(limit));
if (current_length >= 32) return error(f, VORBIS_invalid_setup);
if (current_entry + n > (int) c->entries) { return error(f, VORBIS_invalid_setup); }
memset(lengths + current_entry, current_length, n);
current_entry += n;
++current_length;
}
} else {
for (j=0; j < c->entries; ++j) {
int present = c->sparse ? get_bits(f,1) : 1;
if (present) {
lengths[j] = get_bits(f, 5) + 1;
++total;
if (lengths[j] == 32)
return error(f, VORBIS_invalid_setup);
} else {
lengths[j] = NO_CODE;
}
}
}
if (c->sparse && total >= c->entries >> 2) {
// convert sparse items to non-sparse!
if (c->entries > (int) f->setup_temp_memory_required)
f->setup_temp_memory_required = c->entries;
c->codeword_lengths = (uint8 *) setup_malloc(f, c->entries);
if (c->codeword_lengths == NULL) return error(f, VORBIS_outofmem);
memcpy(c->codeword_lengths, lengths, c->entries);
setup_temp_free(f, lengths, c->entries); // note this is only safe if there have been no intervening temp mallocs!
lengths = c->codeword_lengths;
c->sparse = 0;
}
// compute the size of the sorted tables
if (c->sparse) {
sorted_count = total;
} else {
sorted_count = 0;
#ifndef STB_VORBIS_NO_HUFFMAN_BINARY_SEARCH
for (j=0; j < c->entries; ++j)
if (lengths[j] > STB_VORBIS_FAST_HUFFMAN_LENGTH && lengths[j] != NO_CODE)
++sorted_count;
#endif
}
c->sorted_entries = sorted_count;
values = NULL;
CHECK(f);
if (!c->sparse) {
c->codewords = (uint32 *) setup_malloc(f, sizeof(c->codewords[0]) * c->entries);
if (!c->codewords) return error(f, VORBIS_outofmem);
} else {
unsigned int size;
if (c->sorted_entries) {
c->codeword_lengths = (uint8 *) setup_malloc(f, c->sorted_entries);
if (!c->codeword_lengths) return error(f, VORBIS_outofmem);
c->codewords = (uint32 *) setup_temp_malloc(f, sizeof(*c->codewords) * c->sorted_entries);
if (!c->codewords) return error(f, VORBIS_outofmem);
values = (uint32 *) setup_temp_malloc(f, sizeof(*values) * c->sorted_entries);
if (!values) return error(f, VORBIS_outofmem);
}
size = c->entries + (sizeof(*c->codewords) + sizeof(*values)) * c->sorted_entries;
if (size > f->setup_temp_memory_required)
f->setup_temp_memory_required = size;
}
if (!compute_codewords(c, lengths, c->entries, values)) {
if (c->sparse) setup_temp_free(f, values, 0);
return error(f, VORBIS_invalid_setup);
}
if (c->sorted_entries) {
// allocate an extra slot for sentinels
c->sorted_codewords = (uint32 *) setup_malloc(f, sizeof(*c->sorted_codewords) * (c->sorted_entries+1));
if (c->sorted_codewords == NULL) return error(f, VORBIS_outofmem);
// allocate an extra slot at the front so that c->sorted_values[-1] is defined
// so that we can catch that case without an extra if
c->sorted_values = ( int *) setup_malloc(f, sizeof(*c->sorted_values ) * (c->sorted_entries+1));
if (c->sorted_values == NULL) return error(f, VORBIS_outofmem);
++c->sorted_values;
c->sorted_values[-1] = -1;
compute_sorted_huffman(c, lengths, values);
}
if (c->sparse) {
setup_temp_free(f, values, sizeof(*values)*c->sorted_entries);
setup_temp_free(f, c->codewords, sizeof(*c->codewords)*c->sorted_entries);
setup_temp_free(f, lengths, c->entries);
c->codewords = NULL;
}
compute_accelerated_huffman(c);
CHECK(f);
c->lookup_type = get_bits(f, 4);
if (c->lookup_type > 2) return error(f, VORBIS_invalid_setup);
if (c->lookup_type > 0) {
uint16 *mults;
c->minimum_value = float32_unpack(get_bits(f, 32));
c->delta_value = float32_unpack(get_bits(f, 32));
c->value_bits = get_bits(f, 4)+1;
c->sequence_p = get_bits(f,1);
if (c->lookup_type == 1) {
int values = lookup1_values(c->entries, c->dimensions);
if (values < 0) return error(f, VORBIS_invalid_setup);
c->lookup_values = (uint32) values;
} else {
c->lookup_values = c->entries * c->dimensions;
}
if (c->lookup_values == 0) return error(f, VORBIS_invalid_setup);
mults = (uint16 *) setup_temp_malloc(f, sizeof(mults[0]) * c->lookup_values);
if (mults == NULL) return error(f, VORBIS_outofmem);
for (j=0; j < (int) c->lookup_values; ++j) {
int q = get_bits(f, c->value_bits);
if (q == EOP) { setup_temp_free(f,mults,sizeof(mults[0])*c->lookup_values); return error(f, VORBIS_invalid_setup); }
mults[j] = q;
}
#ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK
if (c->lookup_type == 1) {
int len, sparse = c->sparse;
float last=0;
// pre-expand the lookup1-style multiplicands, to avoid a divide in the inner loop
if (sparse) {
if (c->sorted_entries == 0) goto skip;
c->multiplicands = (codetype *) setup_malloc(f, sizeof(c->multiplicands[0]) * c->sorted_entries * c->dimensions);
} else
c->multiplicands = (codetype *) setup_malloc(f, sizeof(c->multiplicands[0]) * c->entries * c->dimensions);
if (c->multiplicands == NULL) { setup_temp_free(f,mults,sizeof(mults[0])*c->lookup_values); return error(f, VORBIS_outofmem); }
len = sparse ? c->sorted_entries : c->entries;
for (j=0; j < len; ++j) {
unsigned int z = sparse ? c->sorted_values[j] : j;
unsigned int div=1;
for (k=0; k < c->dimensions; ++k) {
int off = (z / div) % c->lookup_values;
float val = mults[off];
val = mults[off]*c->delta_value + c->minimum_value + last;
c->multiplicands[j*c->dimensions + k] = val;
if (c->sequence_p)
last = val;
if (k+1 < c->dimensions) {
if (div > UINT_MAX / (unsigned int) c->lookup_values) {
setup_temp_free(f, mults,sizeof(mults[0])*c->lookup_values);
return error(f, VORBIS_invalid_setup);
}
div *= c->lookup_values;
}
}
}
c->lookup_type = 2;
}
else
#endif
{
float last=0;
CHECK(f);
c->multiplicands = (codetype *) setup_malloc(f, sizeof(c->multiplicands[0]) * c->lookup_values);
if (c->multiplicands == NULL) { setup_temp_free(f, mults,sizeof(mults[0])*c->lookup_values); return error(f, VORBIS_outofmem); }
for (j=0; j < (int) c->lookup_values; ++j) {
float val = mults[j] * c->delta_value + c->minimum_value + last;
c->multiplicands[j] = val;
if (c->sequence_p)
last = val;
}
}
#ifndef STB_VORBIS_DIVIDES_IN_CODEBOOK
skip:;
#endif
setup_temp_free(f, mults, sizeof(mults[0])*c->lookup_values);
CHECK(f);
}
CHECK(f);
}
// time domain transfers (notused)
x = get_bits(f, 6) + 1;
for (i=0; i < x; ++i) {
uint32 z = get_bits(f, 16);
if (z != 0) return error(f, VORBIS_invalid_setup);
}
// Floors
f->floor_count = get_bits(f, 6)+1;
f->floor_config = (Floor *) setup_malloc(f, f->floor_count * sizeof(*f->floor_config));
if (f->floor_config == NULL) return error(f, VORBIS_outofmem);
for (i=0; i < f->floor_count; ++i) {
f->floor_types[i] = get_bits(f, 16);
if (f->floor_types[i] > 1) return error(f, VORBIS_invalid_setup);
if (f->floor_types[i] == 0) {
Floor0 *g = &f->floor_config[i].floor0;
g->order = get_bits(f,8);
g->rate = get_bits(f,16);
g->bark_map_size = get_bits(f,16);
g->amplitude_bits = get_bits(f,6);
g->amplitude_offset = get_bits(f,8);
g->number_of_books = get_bits(f,4) + 1;
for (j=0; j < g->number_of_books; ++j)
g->book_list[j] = get_bits(f,8);
return error(f, VORBIS_feature_not_supported);
} else {
stbv__floor_ordering p[31*8+2];
Floor1 *g = &f->floor_config[i].floor1;
int max_class = -1;
g->partitions = get_bits(f, 5);
for (j=0; j < g->partitions; ++j) {
g->partition_class_list[j] = get_bits(f, 4);
if (g->partition_class_list[j] > max_class)
max_class = g->partition_class_list[j];
}
for (j=0; j <= max_class; ++j) {
g->class_dimensions[j] = get_bits(f, 3)+1;
g->class_subclasses[j] = get_bits(f, 2);
if (g->class_subclasses[j]) {
g->class_masterbooks[j] = get_bits(f, 8);
if (g->class_masterbooks[j] >= f->codebook_count) return error(f, VORBIS_invalid_setup);
}
for (k=0; k < 1 << g->class_subclasses[j]; ++k) {
g->subclass_books[j][k] = get_bits(f,8)-1;
if (g->subclass_books[j][k] >= f->codebook_count) return error(f, VORBIS_invalid_setup);
}
}
g->floor1_multiplier = get_bits(f,2)+1;
g->rangebits = get_bits(f,4);
g->Xlist[0] = 0;
g->Xlist[1] = 1 << g->rangebits;
g->values = 2;
for (j=0; j < g->partitions; ++j) {
int c = g->partition_class_list[j];
for (k=0; k < g->class_dimensions[c]; ++k) {
g->Xlist[g->values] = get_bits(f, g->rangebits);
++g->values;
}
}
// precompute the sorting
for (j=0; j < g->values; ++j) {
p[j].x = g->Xlist[j];
p[j].id = j;
}
qsort(p, g->values, sizeof(p[0]), point_compare);
for (j=0; j < g->values-1; ++j)
if (p[j].x == p[j+1].x)
return error(f, VORBIS_invalid_setup);
for (j=0; j < g->values; ++j)
g->sorted_order[j] = (uint8) p[j].id;
// precompute the neighbors
for (j=2; j < g->values; ++j) {
int low = 0,hi = 0;
neighbors(g->Xlist, j, &low,&hi);
g->neighbors[j][0] = low;
g->neighbors[j][1] = hi;
}
if (g->values > longest_floorlist)
longest_floorlist = g->values;
}
}
// Residue
f->residue_count = get_bits(f, 6)+1;
f->residue_config = (Residue *) setup_malloc(f, f->residue_count * sizeof(f->residue_config[0]));
if (f->residue_config == NULL) return error(f, VORBIS_outofmem);
memset(f->residue_config, 0, f->residue_count * sizeof(f->residue_config[0]));
for (i=0; i < f->residue_count; ++i) {
uint8 residue_cascade[64];
Residue *r = f->residue_config+i;
f->residue_types[i] = get_bits(f, 16);
if (f->residue_types[i] > 2) return error(f, VORBIS_invalid_setup);
r->begin = get_bits(f, 24);
r->end = get_bits(f, 24);
if (r->end < r->begin) return error(f, VORBIS_invalid_setup);
r->part_size = get_bits(f,24)+1;
r->classifications = get_bits(f,6)+1;
r->classbook = get_bits(f,8);
if (r->classbook >= f->codebook_count) return error(f, VORBIS_invalid_setup);
for (j=0; j < r->classifications; ++j) {
uint8 high_bits=0;
uint8 low_bits=get_bits(f,3);
if (get_bits(f,1))
high_bits = get_bits(f,5);
residue_cascade[j] = high_bits*8 + low_bits;
}
r->residue_books = (short (*)[8]) setup_malloc(f, sizeof(r->residue_books[0]) * r->classifications);
if (r->residue_books == NULL) return error(f, VORBIS_outofmem);
for (j=0; j < r->classifications; ++j) {
for (k=0; k < 8; ++k) {
if (residue_cascade[j] & (1 << k)) {
r->residue_books[j][k] = get_bits(f, 8);
if (r->residue_books[j][k] >= f->codebook_count) return error(f, VORBIS_invalid_setup);
} else {
r->residue_books[j][k] = -1;
}
}
}
// precompute the classifications[] array to avoid inner-loop mod/divide
// call it 'classdata' since we already have r->classifications
r->classdata = (uint8 **) setup_malloc(f, sizeof(*r->classdata) * f->codebooks[r->classbook].entries);
if (!r->classdata) return error(f, VORBIS_outofmem);
memset(r->classdata, 0, sizeof(*r->classdata) * f->codebooks[r->classbook].entries);
for (j=0; j < f->codebooks[r->classbook].entries; ++j) {
int classwords = f->codebooks[r->classbook].dimensions;
int temp = j;
r->classdata[j] = (uint8 *) setup_malloc(f, sizeof(r->classdata[j][0]) * classwords);
if (r->classdata[j] == NULL) return error(f, VORBIS_outofmem);
for (k=classwords-1; k >= 0; --k) {
r->classdata[j][k] = temp % r->classifications;
temp /= r->classifications;
}
}
}
f->mapping_count = get_bits(f,6)+1;
f->mapping = (Mapping *) setup_malloc(f, f->mapping_count * sizeof(*f->mapping));
if (f->mapping == NULL) return error(f, VORBIS_outofmem);
memset(f->mapping, 0, f->mapping_count * sizeof(*f->mapping));
for (i=0; i < f->mapping_count; ++i) {
Mapping *m = f->mapping + i;
int mapping_type = get_bits(f,16);
if (mapping_type != 0) return error(f, VORBIS_invalid_setup);
m->chan = (MappingChannel *) setup_malloc(f, f->channels * sizeof(*m->chan));
if (m->chan == NULL) return error(f, VORBIS_outofmem);
if (get_bits(f,1))
m->submaps = get_bits(f,4)+1;
else
m->submaps = 1;
if (m->submaps > max_submaps)
max_submaps = m->submaps;
if (get_bits(f,1)) {
m->coupling_steps = get_bits(f,8)+1;
if (m->coupling_steps > f->channels) return error(f, VORBIS_invalid_setup);
for (k=0; k < m->coupling_steps; ++k) {
m->chan[k].magnitude = get_bits(f, ilog(f->channels-1));
m->chan[k].angle = get_bits(f, ilog(f->channels-1));
if (m->chan[k].magnitude >= f->channels) return error(f, VORBIS_invalid_setup);
if (m->chan[k].angle >= f->channels) return error(f, VORBIS_invalid_setup);
if (m->chan[k].magnitude == m->chan[k].angle) return error(f, VORBIS_invalid_setup);
}
} else
m->coupling_steps = 0;
// reserved field
if (get_bits(f,2)) return error(f, VORBIS_invalid_setup);
if (m->submaps > 1) {
for (j=0; j < f->channels; ++j) {
m->chan[j].mux = get_bits(f, 4);
if (m->chan[j].mux >= m->submaps) return error(f, VORBIS_invalid_setup);
}
} else
// @SPECIFICATION: this case is missing from the spec
for (j=0; j < f->channels; ++j)
m->chan[j].mux = 0;
for (j=0; j < m->submaps; ++j) {
get_bits(f,8); // discard
m->submap_floor[j] = get_bits(f,8);
m->submap_residue[j] = get_bits(f,8);
if (m->submap_floor[j] >= f->floor_count) return error(f, VORBIS_invalid_setup);
if (m->submap_residue[j] >= f->residue_count) return error(f, VORBIS_invalid_setup);
}
}
// Modes
f->mode_count = get_bits(f, 6)+1;
for (i=0; i < f->mode_count; ++i) {
Mode *m = f->mode_config+i;
m->blockflag = get_bits(f,1);
m->windowtype = get_bits(f,16);
m->transformtype = get_bits(f,16);
m->mapping = get_bits(f,8);
if (m->windowtype != 0) return error(f, VORBIS_invalid_setup);
if (m->transformtype != 0) return error(f, VORBIS_invalid_setup);
if (m->mapping >= f->mapping_count) return error(f, VORBIS_invalid_setup);
}
flush_packet(f);
f->previous_length = 0;
for (i=0; i < f->channels; ++i) {
f->channel_buffers[i] = (float *) setup_malloc(f, sizeof(float) * f->blocksize_1);
f->previous_window[i] = (float *) setup_malloc(f, sizeof(float) * f->blocksize_1/2);
f->finalY[i] = (int16 *) setup_malloc(f, sizeof(int16) * longest_floorlist);
if (f->channel_buffers[i] == NULL || f->previous_window[i] == NULL || f->finalY[i] == NULL) return error(f, VORBIS_outofmem);
memset(f->channel_buffers[i], 0, sizeof(float) * f->blocksize_1);
#ifdef STB_VORBIS_NO_DEFER_FLOOR
f->floor_buffers[i] = (float *) setup_malloc(f, sizeof(float) * f->blocksize_1/2);
if (f->floor_buffers[i] == NULL) return error(f, VORBIS_outofmem);
#endif
}
if (!init_blocksize(f, 0, f->blocksize_0)) return FALSE;
if (!init_blocksize(f, 1, f->blocksize_1)) return FALSE;
f->blocksize[0] = f->blocksize_0;
f->blocksize[1] = f->blocksize_1;
#ifdef STB_VORBIS_DIVIDE_TABLE
if (integer_divide_table[1][1]==0)
for (i=0; i < DIVTAB_NUMER; ++i)
for (j=1; j < DIVTAB_DENOM; ++j)
integer_divide_table[i][j] = i / j;
#endif
// compute how much temporary memory is needed
// 1.
{
uint32 imdct_mem = (f->blocksize_1 * sizeof(float) >> 1);
uint32 classify_mem;
int i,max_part_read=0;
for (i=0; i < f->residue_count; ++i) {
Residue *r = f->residue_config + i;
unsigned int actual_size = f->blocksize_1 / 2;
unsigned int limit_r_begin = r->begin < actual_size ? r->begin : actual_size;
unsigned int limit_r_end = r->end < actual_size ? r->end : actual_size;
int n_read = limit_r_end - limit_r_begin;
int part_read = n_read / r->part_size;
if (part_read > max_part_read)
max_part_read = part_read;
}
#ifndef STB_VORBIS_DIVIDES_IN_RESIDUE
classify_mem = f->channels * (sizeof(void*) + max_part_read * sizeof(uint8 *));
#else
classify_mem = f->channels * (sizeof(void*) + max_part_read * sizeof(int *));
#endif
// maximum reasonable partition size is f->blocksize_1
f->temp_memory_required = classify_mem;
if (imdct_mem > f->temp_memory_required)
f->temp_memory_required = imdct_mem;
}
if (f->alloc.alloc_buffer) {
assert(f->temp_offset == f->alloc.alloc_buffer_length_in_bytes);
// check if there's enough temp memory so we don't error later
if (f->setup_offset + sizeof(*f) + f->temp_memory_required > (unsigned) f->temp_offset)
return error(f, VORBIS_outofmem);
}
// @TODO: stb_vorbis_seek_start expects first_audio_page_offset to point to a page
// without PAGEFLAG_continued_packet, so this either points to the first page, or
// the page after the end of the headers. It might be cleaner to point to a page
// in the middle of the headers, when that's the page where the first audio packet
// starts, but we'd have to also correctly skip the end of any continued packet in
// stb_vorbis_seek_start.
if (f->next_seg == -1) {
f->first_audio_page_offset = stb_vorbis_get_file_offset(f);
} else {
f->first_audio_page_offset = 0;
}
return TRUE;
}
static void vorbis_deinit(stb_vorbis *p)
{
int i,j;
setup_free(p, p->vendor);
for (i=0; i < p->comment_list_length; ++i) {
setup_free(p, p->comment_list[i]);
}
setup_free(p, p->comment_list);
if (p->residue_config) {
for (i=0; i < p->residue_count; ++i) {
Residue *r = p->residue_config+i;
if (r->classdata) {
for (j=0; j < p->codebooks[r->classbook].entries; ++j)
setup_free(p, r->classdata[j]);
setup_free(p, r->classdata);
}
setup_free(p, r->residue_books);
}
}
if (p->codebooks) {
CHECK(p);
for (i=0; i < p->codebook_count; ++i) {
Codebook *c = p->codebooks + i;
setup_free(p, c->codeword_lengths);
setup_free(p, c->multiplicands);
setup_free(p, c->codewords);
setup_free(p, c->sorted_codewords);
// c->sorted_values[-1] is the first entry in the array
setup_free(p, c->sorted_values ? c->sorted_values-1 : NULL);
}
setup_free(p, p->codebooks);
}
setup_free(p, p->floor_config);
setup_free(p, p->residue_config);
if (p->mapping) {
for (i=0; i < p->mapping_count; ++i)
setup_free(p, p->mapping[i].chan);
setup_free(p, p->mapping);
}
CHECK(p);
for (i=0; i < p->channels && i < STB_VORBIS_MAX_CHANNELS; ++i) {
setup_free(p, p->channel_buffers[i]);
setup_free(p, p->previous_window[i]);
#ifdef STB_VORBIS_NO_DEFER_FLOOR
setup_free(p, p->floor_buffers[i]);
#endif
setup_free(p, p->finalY[i]);
}
for (i=0; i < 2; ++i) {
setup_free(p, p->A[i]);
setup_free(p, p->B[i]);
setup_free(p, p->C[i]);
setup_free(p, p->window[i]);
setup_free(p, p->bit_reverse[i]);
}
#ifndef STB_VORBIS_NO_STDIO
if (p->close_on_free) fclose(p->f);
#endif
}
void stb_vorbis_close(stb_vorbis *p)
{
if (p == NULL) return;
vorbis_deinit(p);
setup_free(p,p);
}
static void vorbis_init(stb_vorbis *p, const stb_vorbis_alloc *z)
{
memset(p, 0, sizeof(*p)); // NULL out all malloc'd pointers to start
if (z) {
p->alloc = *z;
p->alloc.alloc_buffer_length_in_bytes &= ~7;
p->temp_offset = p->alloc.alloc_buffer_length_in_bytes;
}
p->eof = 0;
p->error = VORBIS__no_error;
p->stream = NULL;
p->codebooks = NULL;
p->page_crc_tests = -1;
#ifndef STB_VORBIS_NO_STDIO
p->close_on_free = FALSE;
p->f = NULL;
#endif
}
int stb_vorbis_get_sample_offset(stb_vorbis *f)
{
if (f->current_loc_valid)
return f->current_loc;
else
return -1;
}
stb_vorbis_info stb_vorbis_get_info(stb_vorbis *f)
{
stb_vorbis_info d;
d.channels = f->channels;
d.sample_rate = f->sample_rate;
d.setup_memory_required = f->setup_memory_required;
d.setup_temp_memory_required = f->setup_temp_memory_required;
d.temp_memory_required = f->temp_memory_required;
d.max_frame_size = f->blocksize_1 >> 1;
return d;
}
stb_vorbis_comment stb_vorbis_get_comment(stb_vorbis *f)
{
stb_vorbis_comment d;
d.vendor = f->vendor;
d.comment_list_length = f->comment_list_length;
d.comment_list = f->comment_list;
return d;
}
int stb_vorbis_get_error(stb_vorbis *f)
{
int e = f->error;
f->error = VORBIS__no_error;
return e;
}
static stb_vorbis * vorbis_alloc(stb_vorbis *f)
{
stb_vorbis *p = (stb_vorbis *) setup_malloc(f, sizeof(*p));
return p;
}
#ifndef STB_VORBIS_NO_PUSHDATA_API
void stb_vorbis_flush_pushdata(stb_vorbis *f)
{
f->previous_length = 0;
f->page_crc_tests = 0;
f->discard_samples_deferred = 0;
f->current_loc_valid = FALSE;
f->first_decode = FALSE;
f->samples_output = 0;
f->channel_buffer_start = 0;
f->channel_buffer_end = 0;
}
static int vorbis_search_for_page_pushdata(vorb *f, uint8 *data, int data_len)
{
int i,n;
for (i=0; i < f->page_crc_tests; ++i)
f->scan[i].bytes_done = 0;
// if we have room for more scans, search for them first, because
// they may cause us to stop early if their header is incomplete
if (f->page_crc_tests < STB_VORBIS_PUSHDATA_CRC_COUNT) {
if (data_len < 4) return 0;
data_len -= 3; // need to look for 4-byte sequence, so don't miss
// one that straddles a boundary
for (i=0; i < data_len; ++i) {
if (data[i] == 0x4f) {
if (0==memcmp(data+i, ogg_page_header, 4)) {
int j,len;
uint32 crc;
// make sure we have the whole page header
if (i+26 >= data_len || i+27+data[i+26] >= data_len) {
// only read up to this page start, so hopefully we'll
// have the whole page header start next time
data_len = i;
break;
}
// ok, we have it all; compute the length of the page
len = 27 + data[i+26];
for (j=0; j < data[i+26]; ++j)
len += data[i+27+j];
// scan everything up to the embedded crc (which we must 0)
crc = 0;
for (j=0; j < 22; ++j)
crc = crc32_update(crc, data[i+j]);
// now process 4 0-bytes
for ( ; j < 26; ++j)
crc = crc32_update(crc, 0);
// len is the total number of bytes we need to scan
n = f->page_crc_tests++;
f->scan[n].bytes_left = len-j;
f->scan[n].crc_so_far = crc;
f->scan[n].goal_crc = data[i+22] + (data[i+23] << 8) + (data[i+24]<<16) + (data[i+25]<<24);
// if the last frame on a page is continued to the next, then
// we can't recover the sample_loc immediately
if (data[i+27+data[i+26]-1] == 255)
f->scan[n].sample_loc = ~0;
else
f->scan[n].sample_loc = data[i+6] + (data[i+7] << 8) + (data[i+ 8]<<16) + (data[i+ 9]<<24);
f->scan[n].bytes_done = i+j;
if (f->page_crc_tests == STB_VORBIS_PUSHDATA_CRC_COUNT)
break;
// keep going if we still have room for more
}
}
}
}
for (i=0; i < f->page_crc_tests;) {
uint32 crc;
int j;
int n = f->scan[i].bytes_done;
int m = f->scan[i].bytes_left;
if (m > data_len - n) m = data_len - n;
// m is the bytes to scan in the current chunk
crc = f->scan[i].crc_so_far;
for (j=0; j < m; ++j)
crc = crc32_update(crc, data[n+j]);
f->scan[i].bytes_left -= m;
f->scan[i].crc_so_far = crc;
if (f->scan[i].bytes_left == 0) {
// does it match?
if (f->scan[i].crc_so_far == f->scan[i].goal_crc) {
// Houston, we have page
data_len = n+m; // consumption amount is wherever that scan ended
f->page_crc_tests = -1; // drop out of page scan mode
f->previous_length = 0; // decode-but-don't-output one frame
f->next_seg = -1; // start a new page
f->current_loc = f->scan[i].sample_loc; // set the current sample location
// to the amount we'd have decoded had we decoded this page
f->current_loc_valid = f->current_loc != ~0U;
return data_len;
}
// delete entry
f->scan[i] = f->scan[--f->page_crc_tests];
} else {
++i;
}
}
return data_len;
}
// return value: number of bytes we used
int stb_vorbis_decode_frame_pushdata(
stb_vorbis *f, // the file we're decoding
const uint8 *data, int data_len, // the memory available for decoding
int *channels, // place to write number of float * buffers
float ***output, // place to write float ** array of float * buffers
int *samples // place to write number of output samples
)
{
int i;
int len,right,left;
if (!IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing);
if (f->page_crc_tests >= 0) {
*samples = 0;
return vorbis_search_for_page_pushdata(f, (uint8 *) data, data_len);
}
f->stream = (uint8 *) data;
f->stream_end = (uint8 *) data + data_len;
f->error = VORBIS__no_error;
// check that we have the entire packet in memory
if (!is_whole_packet_present(f)) {
*samples = 0;
return 0;
}
if (!vorbis_decode_packet(f, &len, &left, &right)) {
// save the actual error we encountered
enum STBVorbisError error = f->error;
if (error == VORBIS_bad_packet_type) {
// flush and resynch
f->error = VORBIS__no_error;
while (get8_packet(f) != EOP)
if (f->eof) break;
*samples = 0;
return (int) (f->stream - data);
}
if (error == VORBIS_continued_packet_flag_invalid) {
if (f->previous_length == 0) {
// we may be resynching, in which case it's ok to hit one
// of these; just discard the packet
f->error = VORBIS__no_error;
while (get8_packet(f) != EOP)
if (f->eof) break;
*samples = 0;
return (int) (f->stream - data);
}
}
// if we get an error while parsing, what to do?
// well, it DEFINITELY won't work to continue from where we are!
stb_vorbis_flush_pushdata(f);
// restore the error that actually made us bail
f->error = error;
*samples = 0;
return 1;
}
// success!
len = vorbis_finish_frame(f, len, left, right);
for (i=0; i < f->channels; ++i)
f->outputs[i] = f->channel_buffers[i] + left;
if (channels) *channels = f->channels;
*samples = len;
*output = f->outputs;
return (int) (f->stream - data);
}
stb_vorbis *stb_vorbis_open_pushdata(
const unsigned char *data, int data_len, // the memory available for decoding
int *data_used, // only defined if result is not NULL
int *error, const stb_vorbis_alloc *alloc)
{
stb_vorbis *f, p;
vorbis_init(&p, alloc);
p.stream = (uint8 *) data;
p.stream_end = (uint8 *) data + data_len;
p.push_mode = TRUE;
if (!start_decoder(&p)) {
if (p.eof)
*error = VORBIS_need_more_data;
else
*error = p.error;
return NULL;
}
f = vorbis_alloc(&p);
if (f) {
*f = p;
*data_used = (int) (f->stream - data);
*error = 0;
return f;
} else {
vorbis_deinit(&p);
return NULL;
}
}
#endif // STB_VORBIS_NO_PUSHDATA_API
unsigned int stb_vorbis_get_file_offset(stb_vorbis *f)
{
#ifndef STB_VORBIS_NO_PUSHDATA_API
if (f->push_mode) return 0;
#endif
if (USE_MEMORY(f)) return (unsigned int) (f->stream - f->stream_start);
#ifndef STB_VORBIS_NO_STDIO
return (unsigned int) (ftell(f->f) - f->f_start);
#endif
}
#ifndef STB_VORBIS_NO_PULLDATA_API
//
// DATA-PULLING API
//
static uint32 vorbis_find_page(stb_vorbis *f, uint32 *end, uint32 *last)
{
for(;;) {
int n;
if (f->eof) return 0;
n = get8(f);
if (n == 0x4f) { // page header candidate
unsigned int retry_loc = stb_vorbis_get_file_offset(f);
int i;
// check if we're off the end of a file_section stream
if (retry_loc - 25 > f->stream_len)
return 0;
// check the rest of the header
for (i=1; i < 4; ++i)
if (get8(f) != ogg_page_header[i])
break;
if (f->eof) return 0;
if (i == 4) {
uint8 header[27];
uint32 i, crc, goal, len;
for (i=0; i < 4; ++i)
header[i] = ogg_page_header[i];
for (; i < 27; ++i)
header[i] = get8(f);
if (f->eof) return 0;
if (header[4] != 0) goto invalid;
goal = header[22] + (header[23] << 8) + (header[24]<<16) + (header[25]<<24);
for (i=22; i < 26; ++i)
header[i] = 0;
crc = 0;
for (i=0; i < 27; ++i)
crc = crc32_update(crc, header[i]);
len = 0;
for (i=0; i < header[26]; ++i) {
int s = get8(f);
crc = crc32_update(crc, s);
len += s;
}
if (len && f->eof) return 0;
for (i=0; i < len; ++i)
crc = crc32_update(crc, get8(f));
// finished parsing probable page
if (crc == goal) {
// we could now check that it's either got the last
// page flag set, OR it's followed by the capture
// pattern, but I guess TECHNICALLY you could have
// a file with garbage between each ogg page and recover
// from it automatically? So even though that paranoia
// might decrease the chance of an invalid decode by
// another 2^32, not worth it since it would hose those
// invalid-but-useful files?
if (end)
*end = stb_vorbis_get_file_offset(f);
if (last) {
if (header[5] & 0x04)
*last = 1;
else
*last = 0;
}
set_file_offset(f, retry_loc-1);
return 1;
}
}
invalid:
// not a valid page, so rewind and look for next one
set_file_offset(f, retry_loc);
}
}
}
#define SAMPLE_unknown 0xffffffff
// seeking is implemented with a binary search, which narrows down the range to
// 64K, before using a linear search (because finding the synchronization
// pattern can be expensive, and the chance we'd find the end page again is
// relatively high for small ranges)
//
// two initial interpolation-style probes are used at the start of the search
// to try to bound either side of the binary search sensibly, while still
// working in O(log n) time if they fail.
static int get_seek_page_info(stb_vorbis *f, ProbedPage *z)
{
uint8 header[27], lacing[255];
int i,len;
// record where the page starts
z->page_start = stb_vorbis_get_file_offset(f);
// parse the header
getn(f, header, 27);
if (header[0] != 'O' || header[1] != 'g' || header[2] != 'g' || header[3] != 'S')
return 0;
getn(f, lacing, header[26]);
// determine the length of the payload
len = 0;
for (i=0; i < header[26]; ++i)
len += lacing[i];
// this implies where the page ends
z->page_end = z->page_start + 27 + header[26] + len;
// read the last-decoded sample out of the data
z->last_decoded_sample = header[6] + (header[7] << 8) + (header[8] << 16) + (header[9] << 24);
// restore file state to where we were
set_file_offset(f, z->page_start);
return 1;
}
// rarely used function to seek back to the preceding page while finding the
// start of a packet
static int go_to_page_before(stb_vorbis *f, unsigned int limit_offset)
{
unsigned int previous_safe, end;
// now we want to seek back 64K from the limit
if (limit_offset >= 65536 && limit_offset-65536 >= f->first_audio_page_offset)
previous_safe = limit_offset - 65536;
else
previous_safe = f->first_audio_page_offset;
set_file_offset(f, previous_safe);
while (vorbis_find_page(f, &end, NULL)) {
if (end >= limit_offset && stb_vorbis_get_file_offset(f) < limit_offset)
return 1;
set_file_offset(f, end);
}
return 0;
}
// implements the search logic for finding a page and starting decoding. if
// the function succeeds, current_loc_valid will be true and current_loc will
// be less than or equal to the provided sample number (the closer the
// better).
static int seek_to_sample_coarse(stb_vorbis *f, uint32 sample_number)
{
ProbedPage left, right, mid;
int i, start_seg_with_known_loc, end_pos, page_start;
uint32 delta, stream_length, padding, last_sample_limit;
double offset = 0.0, bytes_per_sample = 0.0;
int probe = 0;
// find the last page and validate the target sample
stream_length = stb_vorbis_stream_length_in_samples(f);
if (stream_length == 0) return error(f, VORBIS_seek_without_length);
if (sample_number > stream_length) return error(f, VORBIS_seek_invalid);
// this is the maximum difference between the window-center (which is the
// actual granule position value), and the right-start (which the spec
// indicates should be the granule position (give or take one)).
padding = ((f->blocksize_1 - f->blocksize_0) >> 2);
if (sample_number < padding)
last_sample_limit = 0;
else
last_sample_limit = sample_number - padding;
left = f->p_first;
while (left.last_decoded_sample == ~0U) {
// (untested) the first page does not have a 'last_decoded_sample'
set_file_offset(f, left.page_end);
if (!get_seek_page_info(f, &left)) goto error;
}
right = f->p_last;
assert(right.last_decoded_sample != ~0U);
// starting from the start is handled differently
if (last_sample_limit <= left.last_decoded_sample) {
if (stb_vorbis_seek_start(f)) {
if (f->current_loc > sample_number)
return error(f, VORBIS_seek_failed);
return 1;
}
return 0;
}
while (left.page_end != right.page_start) {
assert(left.page_end < right.page_start);
// search range in bytes
delta = right.page_start - left.page_end;
if (delta <= 65536) {
// there's only 64K left to search - handle it linearly
set_file_offset(f, left.page_end);
} else {
if (probe < 2) {
if (probe == 0) {
// first probe (interpolate)
double data_bytes = right.page_end - left.page_start;
bytes_per_sample = data_bytes / right.last_decoded_sample;
offset = left.page_start + bytes_per_sample * (last_sample_limit - left.last_decoded_sample);
} else {
// second probe (try to bound the other side)
double error = ((double) last_sample_limit - mid.last_decoded_sample) * bytes_per_sample;
if (error >= 0 && error < 8000) error = 8000;
if (error < 0 && error > -8000) error = -8000;
offset += error * 2;
}
// ensure the offset is valid
if (offset < left.page_end)
offset = left.page_end;
if (offset > right.page_start - 65536)
offset = right.page_start - 65536;
set_file_offset(f, (unsigned int) offset);
} else {
// binary search for large ranges (offset by 32K to ensure
// we don't hit the right page)
set_file_offset(f, left.page_end + (delta / 2) - 32768);
}
if (!vorbis_find_page(f, NULL, NULL)) goto error;
}
for (;;) {
if (!get_seek_page_info(f, &mid)) goto error;
if (mid.last_decoded_sample != ~0U) break;
// (untested) no frames end on this page
set_file_offset(f, mid.page_end);
assert(mid.page_start < right.page_start);
}
// if we've just found the last page again then we're in a tricky file,
// and we're close enough (if it wasn't an interpolation probe).
if (mid.page_start == right.page_start) {
if (probe >= 2 || delta <= 65536)
break;
} else {
if (last_sample_limit < mid.last_decoded_sample)
right = mid;
else
left = mid;
}
++probe;
}
// seek back to start of the last packet
page_start = left.page_start;
set_file_offset(f, page_start);
if (!start_page(f)) return error(f, VORBIS_seek_failed);
end_pos = f->end_seg_with_known_loc;
assert(end_pos >= 0);
for (;;) {
for (i = end_pos; i > 0; --i)
if (f->segments[i-1] != 255)
break;
start_seg_with_known_loc = i;
if (start_seg_with_known_loc > 0 || !(f->page_flag & PAGEFLAG_continued_packet))
break;
// (untested) the final packet begins on an earlier page
if (!go_to_page_before(f, page_start))
goto error;
page_start = stb_vorbis_get_file_offset(f);
if (!start_page(f)) goto error;
end_pos = f->segment_count - 1;
}
// prepare to start decoding
f->current_loc_valid = FALSE;
f->last_seg = FALSE;
f->valid_bits = 0;
f->packet_bytes = 0;
f->bytes_in_seg = 0;
f->previous_length = 0;
f->next_seg = start_seg_with_known_loc;
for (i = 0; i < start_seg_with_known_loc; i++)
skip(f, f->segments[i]);
// start decoding (optimizable - this frame is generally discarded)
if (!vorbis_pump_first_frame(f))
return 0;
if (f->current_loc > sample_number)
return error(f, VORBIS_seek_failed);
return 1;
error:
// try to restore the file to a valid state
stb_vorbis_seek_start(f);
return error(f, VORBIS_seek_failed);
}
// the same as vorbis_decode_initial, but without advancing
static int peek_decode_initial(vorb *f, int *p_left_start, int *p_left_end, int *p_right_start, int *p_right_end, int *mode)
{
int bits_read, bytes_read;
if (!vorbis_decode_initial(f, p_left_start, p_left_end, p_right_start, p_right_end, mode))
return 0;
// either 1 or 2 bytes were read, figure out which so we can rewind
bits_read = 1 + ilog(f->mode_count-1);
if (f->mode_config[*mode].blockflag)
bits_read += 2;
bytes_read = (bits_read + 7) / 8;
f->bytes_in_seg += bytes_read;
f->packet_bytes -= bytes_read;
skip(f, -bytes_read);
if (f->next_seg == -1)
f->next_seg = f->segment_count - 1;
else
f->next_seg--;
f->valid_bits = 0;
return 1;
}
int stb_vorbis_seek_frame(stb_vorbis *f, unsigned int sample_number)
{
uint32 max_frame_samples;
if (IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing);
// fast page-level search
if (!seek_to_sample_coarse(f, sample_number))
return 0;
assert(f->current_loc_valid);
assert(f->current_loc <= sample_number);
// linear search for the relevant packet
max_frame_samples = (f->blocksize_1*3 - f->blocksize_0) >> 2;
while (f->current_loc < sample_number) {
int left_start, left_end, right_start, right_end, mode, frame_samples;
if (!peek_decode_initial(f, &left_start, &left_end, &right_start, &right_end, &mode))
return error(f, VORBIS_seek_failed);
// calculate the number of samples returned by the next frame
frame_samples = right_start - left_start;
if (f->current_loc + frame_samples > sample_number) {
return 1; // the next frame will contain the sample
} else if (f->current_loc + frame_samples + max_frame_samples > sample_number) {
// there's a chance the frame after this could contain the sample
vorbis_pump_first_frame(f);
} else {
// this frame is too early to be relevant
f->current_loc += frame_samples;
f->previous_length = 0;
maybe_start_packet(f);
flush_packet(f);
}
}
// the next frame should start with the sample
if (f->current_loc != sample_number) return error(f, VORBIS_seek_failed);
return 1;
}
int stb_vorbis_seek(stb_vorbis *f, unsigned int sample_number)
{
if (!stb_vorbis_seek_frame(f, sample_number))
return 0;
if (sample_number != f->current_loc) {
int n;
uint32 frame_start = f->current_loc;
stb_vorbis_get_frame_float(f, &n, NULL);
assert(sample_number > frame_start);
assert(f->channel_buffer_start + (int) (sample_number-frame_start) <= f->channel_buffer_end);
f->channel_buffer_start += (sample_number - frame_start);
}
return 1;
}
int stb_vorbis_seek_start(stb_vorbis *f)
{
if (IS_PUSH_MODE(f)) { return error(f, VORBIS_invalid_api_mixing); }
set_file_offset(f, f->first_audio_page_offset);
f->previous_length = 0;
f->first_decode = TRUE;
f->next_seg = -1;
return vorbis_pump_first_frame(f);
}
unsigned int stb_vorbis_stream_length_in_samples(stb_vorbis *f)
{
unsigned int restore_offset, previous_safe;
unsigned int end, last_page_loc;
if (IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing);
if (!f->total_samples) {
unsigned int last;
uint32 lo,hi;
char header[6];
// first, store the current decode position so we can restore it
restore_offset = stb_vorbis_get_file_offset(f);
// now we want to seek back 64K from the end (the last page must
// be at most a little less than 64K, but let's allow a little slop)
if (f->stream_len >= 65536 && f->stream_len-65536 >= f->first_audio_page_offset)
previous_safe = f->stream_len - 65536;
else
previous_safe = f->first_audio_page_offset;
set_file_offset(f, previous_safe);
// previous_safe is now our candidate 'earliest known place that seeking
// to will lead to the final page'
if (!vorbis_find_page(f, &end, &last)) {
// if we can't find a page, we're hosed!
f->error = VORBIS_cant_find_last_page;
f->total_samples = 0xffffffff;
goto done;
}
// check if there are more pages
last_page_loc = stb_vorbis_get_file_offset(f);
// stop when the last_page flag is set, not when we reach eof;
// this allows us to stop short of a 'file_section' end without
// explicitly checking the length of the section
while (!last) {
set_file_offset(f, end);
if (!vorbis_find_page(f, &end, &last)) {
// the last page we found didn't have the 'last page' flag
// set. whoops!
break;
}
previous_safe = last_page_loc+1;
last_page_loc = stb_vorbis_get_file_offset(f);
}
set_file_offset(f, last_page_loc);
// parse the header
getn(f, (unsigned char *)header, 6);
// extract the absolute granule position
lo = get32(f);
hi = get32(f);
if (lo == 0xffffffff && hi == 0xffffffff) {
f->error = VORBIS_cant_find_last_page;
f->total_samples = SAMPLE_unknown;
goto done;
}
if (hi)
lo = 0xfffffffe; // saturate
f->total_samples = lo;
f->p_last.page_start = last_page_loc;
f->p_last.page_end = end;
f->p_last.last_decoded_sample = lo;
done:
set_file_offset(f, restore_offset);
}
return f->total_samples == SAMPLE_unknown ? 0 : f->total_samples;
}
float stb_vorbis_stream_length_in_seconds(stb_vorbis *f)
{
return stb_vorbis_stream_length_in_samples(f) / (float) f->sample_rate;
}
int stb_vorbis_get_frame_float(stb_vorbis *f, int *channels, float ***output)
{
int len, right,left,i;
if (IS_PUSH_MODE(f)) return error(f, VORBIS_invalid_api_mixing);
if (!vorbis_decode_packet(f, &len, &left, &right)) {
f->channel_buffer_start = f->channel_buffer_end = 0;
return 0;
}
len = vorbis_finish_frame(f, len, left, right);
for (i=0; i < f->channels; ++i)
f->outputs[i] = f->channel_buffers[i] + left;
f->channel_buffer_start = left;
f->channel_buffer_end = left+len;
if (channels) *channels = f->channels;
if (output) *output = f->outputs;
return len;
}
#ifndef STB_VORBIS_NO_STDIO
stb_vorbis * stb_vorbis_open_file_section(FILE *file, int close_on_free, int *error, const stb_vorbis_alloc *alloc, unsigned int length)
{
stb_vorbis *f, p;
vorbis_init(&p, alloc);
p.f = file;
p.f_start = (uint32) ftell(file);
p.stream_len = length;
p.close_on_free = close_on_free;
if (start_decoder(&p)) {
f = vorbis_alloc(&p);
if (f) {
*f = p;
vorbis_pump_first_frame(f);
return f;
}
}
if (error) *error = p.error;
vorbis_deinit(&p);
return NULL;
}
stb_vorbis * stb_vorbis_open_file(FILE *file, int close_on_free, int *error, const stb_vorbis_alloc *alloc)
{
unsigned int len, start;
start = (unsigned int) ftell(file);
fseek(file, 0, SEEK_END);
len = (unsigned int) (ftell(file) - start);
fseek(file, start, SEEK_SET);
return stb_vorbis_open_file_section(file, close_on_free, error, alloc, len);
}
stb_vorbis * stb_vorbis_open_filename(const char *filename, int *error, const stb_vorbis_alloc *alloc)
{
FILE *f;
#if defined(_WIN32) && defined(__STDC_WANT_SECURE_LIB__)
if (0 != fopen_s(&f, filename, "rb"))
f = NULL;
#else
f = fopen(filename, "rb");
#endif
if (f)
return stb_vorbis_open_file(f, TRUE, error, alloc);
if (error) *error = VORBIS_file_open_failure;
return NULL;
}
#endif // STB_VORBIS_NO_STDIO
stb_vorbis * stb_vorbis_open_memory(const unsigned char *data, int len, int *error, const stb_vorbis_alloc *alloc)
{
stb_vorbis *f, p;
if (data == NULL) return NULL;
vorbis_init(&p, alloc);
p.stream = (uint8 *) data;
p.stream_end = (uint8 *) data + len;
p.stream_start = (uint8 *) p.stream;
p.stream_len = len;
p.push_mode = FALSE;
if (start_decoder(&p)) {
f = vorbis_alloc(&p);
if (f) {
*f = p;
vorbis_pump_first_frame(f);
if (error) *error = VORBIS__no_error;
return f;
}
}
if (error) *error = p.error;
vorbis_deinit(&p);
return NULL;
}
#ifndef STB_VORBIS_NO_INTEGER_CONVERSION
#define PLAYBACK_MONO 1
#define PLAYBACK_LEFT 2
#define PLAYBACK_RIGHT 4
#define L (PLAYBACK_LEFT | PLAYBACK_MONO)
#define C (PLAYBACK_LEFT | PLAYBACK_RIGHT | PLAYBACK_MONO)
#define R (PLAYBACK_RIGHT | PLAYBACK_MONO)
static int8 channel_position[7][6] =
{
{ 0 },
{ C },
{ L, R },
{ L, C, R },
{ L, R, L, R },
{ L, C, R, L, R },
{ L, C, R, L, R, C },
};
#ifndef STB_VORBIS_NO_FAST_SCALED_FLOAT
typedef union {
float f;
int i;
} float_conv;
typedef char stb_vorbis_float_size_test[sizeof(float)==4 && sizeof(int) == 4];
#define FASTDEF(x) float_conv x
// add (1<<23) to convert to int, then divide by 2^SHIFT, then add 0.5/2^SHIFT to round
#define MAGIC(SHIFT) (1.5f * (1 << (23-SHIFT)) + 0.5f/(1 << SHIFT))
#define ADDEND(SHIFT) (((150-SHIFT) << 23) + (1 << 22))
#define FAST_SCALED_FLOAT_TO_INT(temp,x,s) (temp.f = (x) + MAGIC(s), temp.i - ADDEND(s))
#define check_endianness()
#else
#define FAST_SCALED_FLOAT_TO_INT(temp,x,s) ((int) ((x) * (1 << (s))))
#define check_endianness()
#define FASTDEF(x)
#endif
static void copy_samples(short *dest, float *src, int len)
{
int i;
check_endianness();
for (i=0; i < len; ++i) {
FASTDEF(temp);
int v = FAST_SCALED_FLOAT_TO_INT(temp, src[i],15);
if ((unsigned int) (v + 32768) > 65535)
v = v < 0 ? -32768 : 32767;
dest[i] = v;
}
}
static void compute_samples(int mask, short *output, int num_c, float **data, int d_offset, int len)
{
#define BUFFER_SIZE 32
float buffer[BUFFER_SIZE];
int i,j,o,n = BUFFER_SIZE;
check_endianness();
for (o = 0; o < len; o += BUFFER_SIZE) {
memset(buffer, 0, sizeof(buffer));
if (o + n > len) n = len - o;
for (j=0; j < num_c; ++j) {
if (channel_position[num_c][j] & mask) {
for (i=0; i < n; ++i)
buffer[i] += data[j][d_offset+o+i];
}
}
for (i=0; i < n; ++i) {
FASTDEF(temp);
int v = FAST_SCALED_FLOAT_TO_INT(temp,buffer[i],15);
if ((unsigned int) (v + 32768) > 65535)
v = v < 0 ? -32768 : 32767;
output[o+i] = v;
}
}
}
static void compute_stereo_samples(short *output, int num_c, float **data, int d_offset, int len)
{
#define BUFFER_SIZE 32
float buffer[BUFFER_SIZE];
int i,j,o,n = BUFFER_SIZE >> 1;
// o is the offset in the source data
check_endianness();
for (o = 0; o < len; o += BUFFER_SIZE >> 1) {
// o2 is the offset in the output data
int o2 = o << 1;
memset(buffer, 0, sizeof(buffer));
if (o + n > len) n = len - o;
for (j=0; j < num_c; ++j) {
int m = channel_position[num_c][j] & (PLAYBACK_LEFT | PLAYBACK_RIGHT);
if (m == (PLAYBACK_LEFT | PLAYBACK_RIGHT)) {
for (i=0; i < n; ++i) {
buffer[i*2+0] += data[j][d_offset+o+i];
buffer[i*2+1] += data[j][d_offset+o+i];
}
} else if (m == PLAYBACK_LEFT) {
for (i=0; i < n; ++i) {
buffer[i*2+0] += data[j][d_offset+o+i];
}
} else if (m == PLAYBACK_RIGHT) {
for (i=0; i < n; ++i) {
buffer[i*2+1] += data[j][d_offset+o+i];
}
}
}
for (i=0; i < (n<<1); ++i) {
FASTDEF(temp);
int v = FAST_SCALED_FLOAT_TO_INT(temp,buffer[i],15);
if ((unsigned int) (v + 32768) > 65535)
v = v < 0 ? -32768 : 32767;
output[o2+i] = v;
}
}
}
static void convert_samples_short(int buf_c, short **buffer, int b_offset, int data_c, float **data, int d_offset, int samples)
{
int i;
if (buf_c != data_c && buf_c <= 2 && data_c <= 6) {
static int channel_selector[3][2] = { {0}, {PLAYBACK_MONO}, {PLAYBACK_LEFT, PLAYBACK_RIGHT} };
for (i=0; i < buf_c; ++i)
compute_samples(channel_selector[buf_c][i], buffer[i]+b_offset, data_c, data, d_offset, samples);
} else {
int limit = buf_c < data_c ? buf_c : data_c;
for (i=0; i < limit; ++i)
copy_samples(buffer[i]+b_offset, data[i]+d_offset, samples);
for ( ; i < buf_c; ++i)
memset(buffer[i]+b_offset, 0, sizeof(short) * samples);
}
}
int stb_vorbis_get_frame_short(stb_vorbis *f, int num_c, short **buffer, int num_samples)
{
float **output = NULL;
int len = stb_vorbis_get_frame_float(f, NULL, &output);
if (len > num_samples) len = num_samples;
if (len)
convert_samples_short(num_c, buffer, 0, f->channels, output, 0, len);
return len;
}
static void convert_channels_short_interleaved(int buf_c, short *buffer, int data_c, float **data, int d_offset, int len)
{
int i;
check_endianness();
if (buf_c != data_c && buf_c <= 2 && data_c <= 6) {
assert(buf_c == 2);
for (i=0; i < buf_c; ++i)
compute_stereo_samples(buffer, data_c, data, d_offset, len);
} else {
int limit = buf_c < data_c ? buf_c : data_c;
int j;
for (j=0; j < len; ++j) {
for (i=0; i < limit; ++i) {
FASTDEF(temp);
float f = data[i][d_offset+j];
int v = FAST_SCALED_FLOAT_TO_INT(temp, f,15);//data[i][d_offset+j],15);
if ((unsigned int) (v + 32768) > 65535)
v = v < 0 ? -32768 : 32767;
*buffer++ = v;
}
for ( ; i < buf_c; ++i)
*buffer++ = 0;
}
}
}
int stb_vorbis_get_frame_short_interleaved(stb_vorbis *f, int num_c, short *buffer, int num_shorts)
{
float **output;
int len;
if (num_c == 1) return stb_vorbis_get_frame_short(f,num_c,&buffer, num_shorts);
len = stb_vorbis_get_frame_float(f, NULL, &output);
if (len) {
if (len*num_c > num_shorts) len = num_shorts / num_c;
convert_channels_short_interleaved(num_c, buffer, f->channels, output, 0, len);
}
return len;
}
int stb_vorbis_get_samples_short_interleaved(stb_vorbis *f, int channels, short *buffer, int num_shorts)
{
float **outputs;
int len = num_shorts / channels;
int n=0;
int z = f->channels;
if (z > channels) z = channels;
while (n < len) {
int k = f->channel_buffer_end - f->channel_buffer_start;
if (n+k >= len) k = len - n;
if (k)
convert_channels_short_interleaved(channels, buffer, f->channels, f->channel_buffers, f->channel_buffer_start, k);
buffer += k*channels;
n += k;
f->channel_buffer_start += k;
if (n == len) break;
if (!stb_vorbis_get_frame_float(f, NULL, &outputs)) break;
}
return n;
}
int stb_vorbis_get_samples_short(stb_vorbis *f, int channels, short **buffer, int len)
{
float **outputs;
int n=0;
int z = f->channels;
if (z > channels) z = channels;
while (n < len) {
int k = f->channel_buffer_end - f->channel_buffer_start;
if (n+k >= len) k = len - n;
if (k)
convert_samples_short(channels, buffer, n, f->channels, f->channel_buffers, f->channel_buffer_start, k);
n += k;
f->channel_buffer_start += k;
if (n == len) break;
if (!stb_vorbis_get_frame_float(f, NULL, &outputs)) break;
}
return n;
}
#ifndef STB_VORBIS_NO_STDIO
int stb_vorbis_decode_filename(const char *filename, int *channels, int *sample_rate, short **output)
{
int data_len, offset, total, limit, error;
short *data;
stb_vorbis *v = stb_vorbis_open_filename(filename, &error, NULL);
if (v == NULL) return -1;
limit = v->channels * 4096;
*channels = v->channels;
if (sample_rate)
*sample_rate = v->sample_rate;
offset = data_len = 0;
total = limit;
data = (short *) malloc(total * sizeof(*data));
if (data == NULL) {
stb_vorbis_close(v);
return -2;
}
for (;;) {
int n = stb_vorbis_get_frame_short_interleaved(v, v->channels, data+offset, total-offset);
if (n == 0) break;
data_len += n;
offset += n * v->channels;
if (offset + limit > total) {
short *data2;
total *= 2;
data2 = (short *) realloc(data, total * sizeof(*data));
if (data2 == NULL) {
free(data);
stb_vorbis_close(v);
return -2;
}
data = data2;
}
}
*output = data;
stb_vorbis_close(v);
return data_len;
}
#endif // NO_STDIO
int stb_vorbis_decode_memory(const uint8 *mem, int len, int *channels, int *sample_rate, short **output)
{
int data_len, offset, total, limit, error;
short *data;
stb_vorbis *v = stb_vorbis_open_memory(mem, len, &error, NULL);
if (v == NULL) return -1;
limit = v->channels * 4096;
*channels = v->channels;
if (sample_rate)
*sample_rate = v->sample_rate;
offset = data_len = 0;
total = limit;
data = (short *) malloc(total * sizeof(*data));
if (data == NULL) {
stb_vorbis_close(v);
return -2;
}
for (;;) {
int n = stb_vorbis_get_frame_short_interleaved(v, v->channels, data+offset, total-offset);
if (n == 0) break;
data_len += n;
offset += n * v->channels;
if (offset + limit > total) {
short *data2;
total *= 2;
data2 = (short *) realloc(data, total * sizeof(*data));
if (data2 == NULL) {
free(data);
stb_vorbis_close(v);
return -2;
}
data = data2;
}
}
*output = data;
stb_vorbis_close(v);
return data_len;
}
#endif // STB_VORBIS_NO_INTEGER_CONVERSION
int stb_vorbis_get_samples_float_interleaved(stb_vorbis *f, int channels, float *buffer, int num_floats)
{
float **outputs;
int len = num_floats / channels;
int n=0;
int z = f->channels;
if (z > channels) z = channels;
while (n < len) {
int i,j;
int k = f->channel_buffer_end - f->channel_buffer_start;
if (n+k >= len) k = len - n;
for (j=0; j < k; ++j) {
for (i=0; i < z; ++i)
*buffer++ = f->channel_buffers[i][f->channel_buffer_start+j];
for ( ; i < channels; ++i)
*buffer++ = 0;
}
n += k;
f->channel_buffer_start += k;
if (n == len)
break;
if (!stb_vorbis_get_frame_float(f, NULL, &outputs))
break;
}
return n;
}
int stb_vorbis_get_samples_float(stb_vorbis *f, int channels, float **buffer, int num_samples)
{
float **outputs;
int n=0;
int z = f->channels;
if (z > channels) z = channels;
while (n < num_samples) {
int i;
int k = f->channel_buffer_end - f->channel_buffer_start;
if (n+k >= num_samples) k = num_samples - n;
if (k) {
for (i=0; i < z; ++i)
memcpy(buffer[i]+n, f->channel_buffers[i]+f->channel_buffer_start, sizeof(float)*k);
for ( ; i < channels; ++i)
memset(buffer[i]+n, 0, sizeof(float) * k);
}
n += k;
f->channel_buffer_start += k;
if (n == num_samples)
break;
if (!stb_vorbis_get_frame_float(f, NULL, &outputs))
break;
}
return n;
}
#endif // STB_VORBIS_NO_PULLDATA_API
/* Version history
1.17 - 2019-07-08 - fix CVE-2019-13217, -13218, -13219, -13220, -13221, -13222, -13223
found with Mayhem by ForAllSecure
1.16 - 2019-03-04 - fix warnings
1.15 - 2019-02-07 - explicit failure if Ogg Skeleton data is found
1.14 - 2018-02-11 - delete bogus dealloca usage
1.13 - 2018-01-29 - fix truncation of last frame (hopefully)
1.12 - 2017-11-21 - limit residue begin/end to blocksize/2 to avoid large temp allocs in bad/corrupt files
1.11 - 2017-07-23 - fix MinGW compilation
1.10 - 2017-03-03 - more robust seeking; fix negative ilog(); clear error in open_memory
1.09 - 2016-04-04 - back out 'avoid discarding last frame' fix from previous version
1.08 - 2016-04-02 - fixed multiple warnings; fix setup memory leaks;
avoid discarding last frame of audio data
1.07 - 2015-01-16 - fixed some warnings, fix mingw, const-correct API
some more crash fixes when out of memory or with corrupt files
1.06 - 2015-08-31 - full, correct support for seeking API (Dougall Johnson)
some crash fixes when out of memory or with corrupt files
1.05 - 2015-04-19 - don't define __forceinline if it's redundant
1.04 - 2014-08-27 - fix missing const-correct case in API
1.03 - 2014-08-07 - Warning fixes
1.02 - 2014-07-09 - Declare qsort compare function _cdecl on windows
1.01 - 2014-06-18 - fix stb_vorbis_get_samples_float
1.0 - 2014-05-26 - fix memory leaks; fix warnings; fix bugs in multichannel
(API change) report sample rate for decode-full-file funcs
0.99996 - bracket #include <malloc.h> for macintosh compilation by Laurent Gomila
0.99995 - use union instead of pointer-cast for fast-float-to-int to avoid alias-optimization problem
0.99994 - change fast-float-to-int to work in single-precision FPU mode, remove endian-dependence
0.99993 - remove assert that fired on legal files with empty tables
0.99992 - rewind-to-start
0.99991 - bugfix to stb_vorbis_get_samples_short by Bernhard Wodo
0.9999 - (should have been 0.99990) fix no-CRT support, compiling as C++
0.9998 - add a full-decode function with a memory source
0.9997 - fix a bug in the read-from-FILE case in 0.9996 addition
0.9996 - query length of vorbis stream in samples/seconds
0.9995 - bugfix to another optimization that only happened in certain files
0.9994 - bugfix to one of the optimizations that caused significant (but inaudible?) errors
0.9993 - performance improvements; runs in 99% to 104% of time of reference implementation
0.9992 - performance improvement of IMDCT; now performs close to reference implementation
0.9991 - performance improvement of IMDCT
0.999 - (should have been 0.9990) performance improvement of IMDCT
0.998 - no-CRT support from Casey Muratori
0.997 - bugfixes for bugs found by Terje Mathisen
0.996 - bugfix: fast-huffman decode initialized incorrectly for sparse codebooks; fixing gives 10% speedup - found by Terje Mathisen
0.995 - bugfix: fix to 'effective' overrun detection - found by Terje Mathisen
0.994 - bugfix: garbage decode on final VQ symbol of a non-multiple - found by Terje Mathisen
0.993 - bugfix: pushdata API required 1 extra byte for empty page (failed to consume final page if empty) - found by Terje Mathisen
0.992 - fixes for MinGW warning
0.991 - turn fast-float-conversion on by default
0.990 - fix push-mode seek recovery if you seek into the headers
0.98b - fix to bad release of 0.98
0.98 - fix push-mode seek recovery; robustify float-to-int and support non-fast mode
0.97 - builds under c++ (typecasting, don't use 'class' keyword)
0.96 - somehow MY 0.95 was right, but the web one was wrong, so here's my 0.95 rereleased as 0.96, fixes a typo in the clamping code
0.95 - clamping code for 16-bit functions
0.94 - not publically released
0.93 - fixed all-zero-floor case (was decoding garbage)
0.92 - fixed a memory leak
0.91 - conditional compiles to omit parts of the API and the infrastructure to support them: STB_VORBIS_NO_PULLDATA_API, STB_VORBIS_NO_PUSHDATA_API, STB_VORBIS_NO_STDIO, STB_VORBIS_NO_INTEGER_CONVERSION
0.90 - first public release
*/
#endif // STB_VORBIS_HEADER_ONLY
/*
------------------------------------------------------------------------------
This software is available under 2 licenses -- choose whichever you prefer.
------------------------------------------------------------------------------
ALTERNATIVE A - MIT License
Copyright (c) 2017 Sean Barrett
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
------------------------------------------------------------------------------
ALTERNATIVE B - Public Domain (www.unlicense.org)
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or distribute this
software, either in source code form or as a compiled binary, for any purpose,
commercial or non-commercial, and by any means.
In jurisdictions that recognize copyright laws, the author or authors of this
software dedicate any and all copyright interest in the software to the public
domain. We make this dedication for the benefit of the public at large and to
the detriment of our heirs and successors. We intend this dedication to be an
overt act of relinquishment in perpetuity of all present and future rights to
this software under copyright law.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
------------------------------------------------------------------------------
*/
|
the_stack_data/42061.c | #include <assert.h>
#include <errno.h>
#include <limits.h>
#include <regex.h>
#include <stdarg.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/file.h>
#include <time.h>
#include <unistd.h>
void logging(FILE* file, const char* fmt, ...) {
time_t t;
struct tm tm;
time(&t);
localtime_r(&t, &tm);
char timestamp[26] = {'\0'};
strftime(timestamp, sizeof(timestamp), "%Y-%m-%d %H:%M:%S", &tm);
fprintf(file, "%s\t", timestamp);
va_list args;
va_start(args, fmt);
int rc = vfprintf(file, fmt, args);
va_end(args);
fprintf(file, "\n");
fflush(file);
fsync(fileno(file));
}
FILE* logger() {
static FILE* file = NULL;
if (!file) {
char path[PATH_MAX] = {'\0'};
snprintf(path, sizeof(path), "%s/lid-monitor.log", getenv("HOME"));
file = fopen(path, "a");
if (!file) {
logging(stderr, "Open %s failed: %d", path, errno);
} else {
logging(stderr, "Open %s succeed", path);
}
}
return file;
}
int logging_system_status() {
char output[1*1024*1024] = {'\0'};
FILE* fp = popen("ps aux", "r");
if (NULL == fp) {
perror("popen");
return errno;
}
fread(output, sizeof(output) - 1, 1, fp);
int status = pclose(fp);
status = ((status == -1 || !WIFEXITED(status)) ? EXIT_FAILURE
: WEXITSTATUS(status));
logging(logger(), "processes:\n%s", output);
memset(output, '\0', sizeof(output));
fp = popen("dmesg -T | tail -100", "r");
if (NULL == fp) {
perror("popen");
return errno;
}
fread(output, sizeof(output) - 1, 1, fp);
status = pclose(fp);
status = ((status == -1 || !WIFEXITED(status)) ? EXIT_FAILURE
: WEXITSTATUS(status));
logging(logger(), "dmesg:\n%s", output);
return status;
}
// When LID closed the system should suspend, if not it means systemctl hang,
// force power off as a rescue to avoid computer damage by high temperature.
void poweroff() {
const char* path = "/proc/sys/kernel/sysrq";
FILE* file = fopen(path, "w");
if (!file) {
logging(logger(), "Open %s failed: %d", path, errno);
return;
}
fputc('1', file);
fclose(file);
path = "/proc/sysrq-trigger";
file = fopen(path, "w");
if (!file) {
logging(logger(), "Open %s failed: %d", path, errno);
return;
}
fputc('o', file);
fclose(file);
}
bool lid_opened() {
const char* path = "/proc/acpi/button/lid/LID/state";
FILE* file = fopen(path, "r");
if (!file) {
logging(logger(), "Open %s failed: %d, treat as lid closed", path, errno);
return false;
}
char line[128] = {'\0'};
fgets(line, sizeof(line), file);
fclose(file);
regex_t regex;
int error = regcomp(®ex, "state: *open", 0);
assert(!error);
error = regexec(®ex, line, 0, NULL, 0);
regfree(®ex);
return error == 0;
}
bool lid_problem() {
for (int i = 0; i < 90; ++i) {
if (lid_opened()) {
return false;
}
if (i > 60) {
logging(logger(), "Laptop LID closed, why not suspend?");
}
sleep(1);
}
return true;
}
int lid_monitor() {
const char* lock_file = "/tmp/lid-monitor.lock";
const int lock_fd = open(lock_file, O_CREAT | O_RDWR | O_CLOEXEC, 0666);
if (lock_fd < 0) {
logging(stderr, "Create lock %s failed: %d", lock_file, errno);
return errno;
}
if (flock(lock_fd, LOCK_EX | LOCK_NB) == -1) {
if (errno != EWOULDBLOCK) {
logging(stderr, "Acquire lock %s failed: %d", lock_file, errno);
}
return errno;
}
do {
if (lid_problem()) {
logging_system_status();
logging(logger(),
"Laptop LID closed but system still running, rescue with force "
"power off");
poweroff();
}
sleep(10);
} while (true);
return 0;
}
int main(int argc, char* argv[]) {
if (setuid(0) == -1) {
perror("setuid");
return EXIT_FAILURE;
}
if (setgid(0) == -1) {
perror("setgid");
return EXIT_FAILURE;
}
return lid_monitor();
}
|
the_stack_data/65727.c |
void scilab_rt_matrix_i2i0i0_i2(int nIn, int mIn, int in[nIn][mIn],
int n, int m,
int nOut, int mOut, int out[nOut][mOut])
{
int i;
int j;
int val0 = 0;
for (i = 0; i < nIn; ++i) {
for (j = 0; j < mIn; ++j) {
val0 += in[i][j];
}
}
for (i = 0; i < nOut; ++i) {
for (j = 0; j < mOut; ++j) {
out[i][j] = val0;
}
}
}
|
the_stack_data/68887629.c | // REQUIRES: powerpc-registered-target
// RUN: %clang_cc1 -triple powerpc64-unknown-unknown -target-cpu pwr10 \
// RUN: -emit-llvm %s -o - | FileCheck %s
unsigned long long ulla, ullb;
unsigned long long test_pdepd(void) {
// CHECK: @llvm.ppc.pdepd
return __builtin_pdepd(ulla, ullb);
}
unsigned long long test_pextd(void) {
// CHECK: @llvm.ppc.pextd
return __builtin_pextd(ulla, ullb);
}
unsigned long long test_cntlzdm(void) {
// CHECK: @llvm.ppc.cntlzdm
return __builtin_cntlzdm(ulla, ullb);
}
unsigned long long test_cnttzdm(void) {
// CHECK: @llvm.ppc.cnttzdm
return __builtin_cnttzdm(ulla, ullb);
}
|
the_stack_data/154714.c |
int a, b, c;
void setA(void)
{
a = 1;
}
void setB(void)
{
b = 1;
}
void setC(void)
{
c = 1;
}
int main(void)
{
if (b == 0)
setB();
if (a == 0)
setA();
test_assert(a == 1);
return 0;
}
|
the_stack_data/314546.c | /* arquivo test_fork2.c */
/* Testa as reacoes do console quando um pai
* morre e o filho continua vivo */
#include <errno.h>
#include <signal.h>
#include <stdio.h>
#include <unistd.h>
int main()
{
int pid ;
printf("Eu sou o pai %d e eu vou criar um filho \n",getpid()) ;
pid=fork() ; /* criacao do filho */
if(pid==-1) /* erro */
{
perror("impossivel de criar um filho\n") ;
}
else if(pid==0) /* acoes do filho */
{
printf("\tOi, eu sou o processo %d, o filho\n",getpid()) ;
printf("\tO dia esta otimo hoje, nao acha?\n") ;
printf("\tBom, desse jeito vou acabar me instalando para sempre\n");
printf("\tOu melhor, assim espero!\n") ;
for(;;) ; /* o filho se bloqueia num loop infinito */
}
else /* acoes do pai */
{
sleep(1) ; /* para separar bem as saidas do pai e do filho */
printf("As luzes comecaram a se apagar para mim, %d\n",getpid()) ;
printf("Minha hora chegou : adeus, %d, meu filho\n",pid) ;
/* e o pai morre de causas naturais */
}
exit(0);
}
|
the_stack_data/43888604.c | #include <stdio.h>
static inline int min(int a, int b) { return a > b ? b : a; }
static inline int max(int a, int b) { return a > b ? a : b; }
int main(void)
{
int N;
scanf("%d", &N);
while (N-- > 0) {
int L, M;
scanf("%d%d", &L, &M);
int x = 0, y = 0, i;
for (i = 0; i < M; i++) {
int a;
scanf("%d", &a);
x = max(x, min(a, L-a));
y = max(y, max(a, L-a));
}
printf("%d %d\n", x, y);
}
return 0;
} |
the_stack_data/97012571.c | // kstrikis' solution for project euler problem 4
// released under The Unlicense
// Find the largest palindrome made from the product of two 3-digit numbers.
// compile with gcc 4.c -lm -o 4
#include<stdio.h>
#include<math.h>
int main(){
int lgpal = 0;
int prod;
for(int x=100; x<1000; x++){
for(int y=100; y<1000; y++){
//5 or 6 digit products
prod = x*y;
if(prod<lgpal) continue;
int len = snprintf(NULL,0,"%d",prod); //returns length of formatted string
char str[len];
sprintf(str,"%d",prod);
if(!(str[len-1]==str[0])) continue;
if(!(str[len-2]==str[1])) continue;
if(!(str[len-3]==str[2])) continue;
lgpal = prod;
}
}
printf("%d\n",lgpal);
}
|
the_stack_data/1167492.c | #include <stdio.h>
/*
* calculate a CRC8
*/
int main(int argc, char* argv[])
{
int i, j;
const unsigned char generator = 0x07;
int crc_size = 8;
const unsigned char* bytes = (const unsigned char*)argv[1];
unsigned char crc = 0; /* start with 0 so first byte can be 'xored' in */
if (argc < 2)
{
printf("error\n");
return -1;
}
for(j=0; bytes[j] != '\0'; ++j)
{
crc ^= bytes[j]; /* XOR-in the next input byte */
for (i = 0; i < 8; i++)
{
if ((crc >> (crc_size - 1)) != 0)
{
crc = (unsigned char)((crc << 1) ^ generator);
}
else
{
crc <<= 1;
}
}
}
printf("%02X\n", crc);
return 0;
}
|
the_stack_data/159516697.c | /*
Escreva um programa em C que calcule o desconto previdenciário de um funcionário. Dado um salário,
o programa deve imprimir o valor do desconto proporcional ao mesmo. O cálculo segue a regra:
o desconto é de 11% do valor do salário, entretanto, o valor máximo de desconto é 570,88.
Variaveis:
salário, descontoMaximo
Entradas:
Salário
Saídas:
Valor do salario com desconto proporcional
*/
#include <stdio.h>
#include <stdlib.h>
int main(){
float descontoMaximo = 570.88;
float salario = 0, novoSalario = 0, desconto = 0;
printf("Informe o valor do salario: ");
scanf("%f",&salario);
desconto = salario * 0.11;
if (desconto >= descontoMaximo){
desconto = descontoMaximo;
}
novoSalario = salario - desconto;
printf("Salario sem desconto: %.2f \n", salario);
printf("Valor do Desconto: %.2f \n", desconto);
printf("Salario com desconto: %.2f \n", novoSalario);
return 0;
} |
the_stack_data/242331195.c | /* dmc - dynamic mail client
* See LICENSE file for copyright and license details.
*/
#include <stdio.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <netinet/in.h>
#include <sys/types.h>
#include <arpa/nameser.h>
#include <resolv.h>
#define BIND_4_COMPAT
static int resmx(const char *domain) {
char host[NS_MAXDNAME+1];
char last[NS_MAXDNAME+1];
typedef union {
HEADER head;
char buf[PACKETSZ];
} pkt_t;
unsigned char buf[PACKETSZ];
unsigned char *rrptr;
pkt_t *pkt = (pkt_t *)buf;
int querylen, len, n, exprc;
int rrtype, antrrtype;
int rrpayloadsz;
querylen = res_querydomain (domain, "", C_IN,T_MX, (void*)&buf, PACKETSZ);
if (ntohs (pkt->head.rcode) == NOERROR) {
n = ntohs (pkt->head.ancount);
if (n==0) {
fprintf(stderr, "No MX found\n");
return 1;
}
/* expand DNS query */
len = dn_expand (buf,
buf + querylen, buf + sizeof(HEADER),
host, sizeof (host));
if (len<0) {
fprintf (stderr, "No MX found\n");
return 1;
}
rrptr = buf + len + 4 + sizeof (HEADER);
while (rrptr < buf+querylen) {
/* expand NAME resolved */
exprc = dn_expand (buf, buf+querylen, rrptr, host, sizeof (host));
if (exprc<0) {
fprintf (stderr, "No MX found\n");
return 1;
}
rrptr += exprc;
rrtype = (rrptr[0]<<8|rrptr[1]);
rrpayloadsz = (rrptr[8]<<8|rrptr[9]);
rrptr += 10;
switch (rrtype) {
/* TODO support for IPv6: case T_AAAA: */
case T_A:
if (strcmp (host, last)) {
printf ("%s\n", host);
if (--n==0) querylen=0;
}
break;
}
antrrtype = rrtype;
rrptr += rrpayloadsz;
}
} else {
printf ("%s\n", domain);
return 1;
}
return 0;
}
int main(int argc, char **argv) {
if (argc>1) {
char *ch = strchr(argv[1], '@');
if (!ch) {
/* do the daemon stuff here */
fprintf (stderr, "TODO: SMTP protocol not yet implemented\n");
} else return resmx (ch+1);
} else printf ("Usage: dmc-smtp [user@domain] # Get MX for domain\n");
return 0;
}
|
the_stack_data/119743.c | /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *\
** **
** Author: Aria Seiler **
** **
** This program is in the public domain. There is no implied warranty, **
** so use it at your own risk. **
** **
\* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
// CREDIT https://gitlab.inria.fr/gustedt/p99/-/blob/master/p99/p99_for.h
#define MAC_CAT_2(_0, _1) _0 ## _1
#define MAC_PASTE_2(_0, _1) MAC_CAT_2(_0, _1)
#define MAC_PRED(N) _MAC_PRED(N)
#define _MAC_PRED(N) _MAC_PRED_(MAC_PRED_ , N)
#define _MAC_PRED_(P, N) P ## N
#define MAC_PRED_1 0
#define MAC_PRED_2 1
#define MAC_PRED_3 2
#define MAC_PRED_4 3
#define _MAC_ARG(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, _16, ...) _16
#define _MAC_NARG_(...) _MAC_ARG(__VA_ARGS__, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,)
#define _MAC_NARG(...) _MAC_NARG_(__VA_ARGS__)
#define MAC_SKP(N, ...) MAC_PASTE_2(MAC_SKP_, N)(__VA_ARGS__)
#define MAC_SKP_0(...) __VA_ARGS__
#define MAC_SKP_1(_0, ...) __VA_ARGS__
#define MAC_SKP_2(_0, ...) MAC_SKP_1(__VA_ARGS__)
#define MAC_SKP_3(_0, ...) MAC_SKP_2(__VA_ARGS__)
#define MAC_CHS(N, ...) _MAC_CHS(MAC_SKP(N, __VA_ARGS__))
#define _MAC_CHS(...) _MAC_CHS_(__VA_ARGS__,)
#define _MAC_CHS_(X, ...) X
#define MAC_PRE_0(...)
#define MAC_PRE_1(_0, ...) _0
#define MAC_PRE_2(_0, ...) _0, MAC_PRE_1(__VA_ARGS__)
#define MAC_PRE_3(_0, ...) _0, MAC_PRE_2(__VA_ARGS__)
#define MAC_LAST(...) MAC_CHS(MAC_PRED(_MAC_NARG(__VA_ARGS__)), __VA_ARGS__,)
#define MAC_ALLBUTLAST(...) MAC_PASTE_2(MAC_PRE_, MAC_PRED(_MAC_NARG(__VA_ARGS__)))(__VA_ARGS__,)
#define MAC_FOR_OP_SEP_REV(NAME, ITER, PREV, CURR) CURR; PREV
#define MAC_FOR_OP_SEQ_REV(NAME, ITER, PREV, CURR) CURR, PREV
#define MAC_FOR_OP_NAME_REV(NAME, ITER, PREV, CURR) CURR NAME PREV
#define MAC_FOR_FUNC_DECLVAR(NAME, ARG, ITER) NAME ARG
#define MAC_FOR_FUNC_V_ASSIGN(NAME, ARG, ITER) Result.ARG = ARG
#define MAC_FOR_FUNC_V_OP(NAME, ARG, ITER) Result.ARG = NAME V.ARG
#define MAC_FOR_FUNC_VV_OP(NAME, ARG, ITER) Result.ARG = A.ARG NAME B.ARG
#define MAC_FOR_FUNC_VS_OP(NAME, ARG, ITER) Result.ARG = V.ARG NAME S
#define MAC_FOR_FUNC_VEC_DOT(NAME, ARG, ITER) (B.ARG*A.ARG)
#define MAC_FOR(NAME, N, OP, FUNC, ...) MAC_PASTE_2(MAC_FOR_, N)(NAME, OP, FUNC, __VA_ARGS__)
#define MAC_FOR_0(NAME, OP, FUNC, ...)
#define MAC_FOR_1(NAME, OP, FUNC, ...) FUNC(NAME, MAC_LAST(__VA_ARGS__), 0)
#define MAC_FOR_2(NAME, OP, FUNC, ...) OP(NAME, 1, MAC_FOR_1(NAME, OP, FUNC, MAC_ALLBUTLAST(__VA_ARGS__)), FUNC(NAME, MAC_LAST(__VA_ARGS__), 1))
#define MAC_FOR_3(NAME, OP, FUNC, ...) OP(NAME, 2, MAC_FOR_2(NAME, OP, FUNC, MAC_ALLBUTLAST(__VA_ARGS__)), FUNC(NAME, MAC_LAST(__VA_ARGS__), 2))
#define MAC_FOR_4(NAME, OP, FUNC, ...) OP(NAME, 3, MAC_FOR_3(NAME, OP, FUNC, MAC_ALLBUTLAST(__VA_ARGS__)), FUNC(NAME, MAC_LAST(__VA_ARGS__), 3))
#define MAC_FOR_ARGS_VEC W, Z, Y, X
#define DECLARE_VECTOR_TYPE(Count, Type) \
typedef union v##Count##Type { \
struct { \
MAC_FOR(Type, Count, MAC_FOR_OP_SEP_REV, MAC_FOR_FUNC_DECLVAR, MAC_FOR_ARGS_VEC); \
}; \
Type E[Count]; \
} v##Count##Type;
#define DEFINE_VECTOR_INIT(Count, Type) \
internal v##Count##Type \
V##Count##Type( \
MAC_FOR(Type, Count, MAC_FOR_OP_SEQ_REV, MAC_FOR_FUNC_DECLVAR, MAC_FOR_ARGS_VEC)) \
{ \
v##Count##Type Result; \
MAC_FOR(, Count, MAC_FOR_OP_SEP_REV, MAC_FOR_FUNC_V_ASSIGN, MAC_FOR_ARGS_VEC); \
return Result; \
}
#define DEFINE_VECTOR_ADD(Count, Type) \
internal v##Count##Type \
V##Count##Type##_Add(v##Count##Type A, \
v##Count##Type B) \
{ \
v##Count##Type Result; \
MAC_FOR(+, Count, MAC_FOR_OP_SEP_REV, MAC_FOR_FUNC_VV_OP, MAC_FOR_ARGS_VEC); \
return Result; \
}
#define DEFINE_VECTOR_SUB(Count, Type) \
internal v##Count##Type \
V##Count##Type##_Sub(v##Count##Type A, \
v##Count##Type B) \
{ \
v##Count##Type Result; \
MAC_FOR(-, Count, MAC_FOR_OP_SEP_REV, MAC_FOR_FUNC_VV_OP, MAC_FOR_ARGS_VEC); \
return Result; \
}
#define DEFINE_VECTOR_MUL_VV(Count, Type) \
internal v##Count##Type \
V##Count##Type##_Mul_VV(v##Count##Type A, \
v##Count##Type B) \
{ \
v##Count##Type Result; \
MAC_FOR(*, Count, MAC_FOR_OP_SEP_REV, MAC_FOR_FUNC_VV_OP, MAC_FOR_ARGS_VEC); \
return Result; \
}
#define DEFINE_VECTOR_MUL_VS(Count, Type) \
internal v##Count##Type \
V##Count##Type##_Mul_VS(v##Count##Type V, \
Type S) \
{ \
v##Count##Type Result; \
MAC_FOR(*, Count, MAC_FOR_OP_SEP_REV, MAC_FOR_FUNC_VS_OP, MAC_FOR_ARGS_VEC); \
return Result; \
}
#define DEFINE_VECTOR_DOT(Count, Type) \
internal Type \
V##Count##Type##_Dot(v##Count##Type A, \
v##Count##Type B) \
{ \
Type Result; \
Result = \
MAC_FOR(+, Count, MAC_FOR_OP_NAME_REV, MAC_FOR_FUNC_VEC_DOT, MAC_FOR_ARGS_VEC); \
return Result; \
}
#define DEFINE_VECTOR_CROSS(Count, Type) \
internal v##Count##Type \
V##Count##Type##_Cross(v##Count##Type A, \
v##Count##Type B) \
{ \
v##Count##Type Result; \
Result.X = (A.Y*B.Z)-(A.Z*B.Y); \
Result.Y = (A.Z*B.X)-(A.X*B.Z); \
Result.Z = (A.X*B.Y)-(A.Y*B.X); \
return Result; \
}
#define DEFINE_VECTOR_LEN(Count, Type) \
internal r64 \
V##Count##Type##_Len(v##Count##Type V) \
{ \
r64 Result = V##Count##Type##_Dot(V, V); \
asm("fsqrt" : "+t" (Result)); \
return Result; \
}
#define DEFINE_VECTOR_CAST(Count, FromType, ToType) \
internal v##Count##ToType \
V##Count##FromType##_ToV##Count##ToType(v##Count##FromType V) \
{ \
v##Count##ToType Result; \
MAC_FOR((ToType), Count, MAC_FOR_OP_SEP_REV, MAC_FOR_FUNC_V_OP, MAC_FOR_ARGS_VEC); \
return Result; \
}
#ifdef INCLUDE_HEADER
DECLARE_VECTOR_TYPE(2, r32)
DECLARE_VECTOR_TYPE(3, r32)
DECLARE_VECTOR_TYPE(4, r32)
DECLARE_VECTOR_TYPE(2, s32)
DECLARE_VECTOR_TYPE(3, u08)
DECLARE_VECTOR_TYPE(4, u08)
DECLARE_VECTOR_TYPE(2, u16)
DECLARE_VECTOR_TYPE(2, u32)
#endif
#ifdef INCLUDE_SOURCE
DEFINE_VECTOR_INIT(3, r32)
DEFINE_VECTOR_INIT(4, u08)
DEFINE_VECTOR_ADD(3, r32)
DEFINE_VECTOR_ADD(3, u08)
DEFINE_VECTOR_ADD(4, u08)
DEFINE_VECTOR_ADD(2, u32)
DEFINE_VECTOR_SUB(3, r32)
DEFINE_VECTOR_MUL_VS(3, r32)
DEFINE_VECTOR_MUL_VS(4, r32)
DEFINE_VECTOR_MUL_VS(3, u08)
DEFINE_VECTOR_MUL_VS(4, u08)
DEFINE_VECTOR_MUL_VV(2, r32)
DEFINE_VECTOR_MUL_VV(3, r32)
DEFINE_VECTOR_DOT(3, r32)
DEFINE_VECTOR_CROSS(3, r32)
DEFINE_VECTOR_LEN(3, r32)
DEFINE_VECTOR_CAST(2, r32, u32)
DEFINE_VECTOR_CAST(2, u32, r32)
DEFINE_VECTOR_CAST(4, u08, r32)
DEFINE_VECTOR_CAST(4, r32, u08)
#endif
#undef DEFINE_VECTOR_MUL_VS
#undef DEFINE_VECTOR_EQUAL
#undef DEFINE_VECTOR_CAST
#undef DECLARE_VECTOR_TYPE |
the_stack_data/3263869.c |
int crypto_verify_32(const unsigned char *x,const unsigned char *y)
{
unsigned int differentbits = 0;
#define F(i) differentbits |= x[i] ^ y[i];
F(0)
F(1)
F(2)
F(3)
F(4)
F(5)
F(6)
F(7)
F(8)
F(9)
F(10)
F(11)
F(12)
F(13)
F(14)
F(15)
F(16)
F(17)
F(18)
F(19)
F(20)
F(21)
F(22)
F(23)
F(24)
F(25)
F(26)
F(27)
F(28)
F(29)
F(30)
F(31)
return (1 & ((differentbits - 1) >> 8)) - 1;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.